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