Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem.
Mattia D'EmidioLuca ForlizziDaniele FrigioniStefano LeucciGuido ProiettiPublished in: J. Comb. Optim. (2019)
Keyphrases
- shortest path
- shortest path problem
- fixed parameter tractable
- minimum spanning tree
- steiner tree
- shortest path algorithm
- routing algorithm
- road network
- weighted graph
- tree structure
- path length
- np hard
- optimal path
- computational problems
- shortest distance
- finding the shortest path
- phase transition
- computational complexity
- graph structure
- approximation algorithms
- query language