Hardness, Approximability, and Fixed-Parameter Tractability of the Clustered Shortest-Path Tree Problem.
Mattia D'EmidioLuca ForlizziDaniele FrigioniStefano LeucciGuido ProiettiPublished in: CoRR (2018)
Keyphrases
- shortest path
- shortest path problem
- steiner tree
- minimum spanning tree
- fixed parameter tractable
- shortest path algorithm
- road network
- path length
- routing algorithm
- np hard
- optimal path
- approximation algorithms
- phase transition
- weighted graph
- tree structure
- computational complexity
- shortest distance
- multi objective
- computational problems
- multi dimensional
- social networks
- finding the shortest path