Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation.
Siamak TazariMatthias Müller-HannemannPublished in: Discret. Appl. Math. (2009)
Keyphrases
- shortest path
- steiner tree
- strongly connected components
- shortest path problem
- minimum spanning tree
- weighted graph
- flow graph
- shortest path algorithm
- path length
- edge weights
- road network
- finding the shortest path
- minimum length
- betweenness centrality
- geodesic distance
- approximation algorithms
- undirected graph
- random walk
- linear programming
- worst case