Approximation Algorithms and Hardness for n-Pairs Shortest Paths and All-Nodes Shortest Cycles.
Mina DalirrooyfardCe JinVirginia Vassilevska WilliamsNicole WeinPublished in: FOCS (2022)
Keyphrases
- shortest path
- approximation algorithms
- np hard
- np hardness
- worst case
- special case
- minimum cost
- path length
- shortest path algorithm
- vertex cover
- shortest distance
- approximation ratio
- road network
- undirected graph
- optimal path
- finding the shortest path
- minimum cost flow
- flow graph
- disjoint paths
- strongly connected components
- lower bound
- travel time
- weighted graph
- greedy algorithm
- constant factor
- randomized algorithms
- primal dual
- betweenness centrality
- np complete
- minimal surface
- geodesic distance
- scheduling problem
- optimal solution