Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem
Crossref DOI link: https://doi.org/10.1007/s10878-018-00374-x
Published Online: 2019-01-02
Published Print: 2019-07
Update policy: https://doi.org/10.1007/springer_crossmark_policy
D’Emidio, Mattia http://orcid.org/0000-0001-7833-9520
Forlizzi, Luca
Frigioni, Daniele
Leucci, Stefano
Proietti, Guido
Text and Data Mining valid from 2019-01-02
Article History
First Online: 2 January 2019