Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem

Mattia D'Emidio, Luca Forlizzi, Daniele Frigioni, Stefano Leucci 0001, Guido Proietti. Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem. J. Comb. Optim., 38(1):165-184, 2019. [doi]

Authors

Mattia D'Emidio

This author has not been identified. Look up 'Mattia D'Emidio' in Google

Luca Forlizzi

This author has not been identified. Look up 'Luca Forlizzi' in Google

Daniele Frigioni

This author has not been identified. Look up 'Daniele Frigioni' in Google

Stefano Leucci 0001

This author has not been identified. Look up 'Stefano Leucci 0001' in Google

Guido Proietti

This author has not been identified. Look up 'Guido Proietti' in Google