Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths.
Matthias BentertFedor V. FominPetr A. GolovachPublished in: CoRR (2024)
Keyphrases
- shortest path
- lower bound
- upper bound
- worst case
- error bounds
- shortest path algorithm
- minimum length
- generalization error bounds
- shortest path problem
- betweenness centrality
- edge weights
- error tolerance
- approximation algorithms
- road network
- weighted graph
- finding the shortest path
- geodesic distance
- optimal path
- travel time
- shortest distance
- path length
- minimal surface
- flow graph
- directed graph
- randomized algorithm
- undirected graph
- branch and bound
- strongly connected components
- optimal solution
- social networks