Better Approximation Algorithms for the Graph Diameter.
Shiri ChechikDaniel H. LarkinLiam RodittyGrant SchoenebeckRobert Endre TarjanVirginia Vassilevska WilliamsPublished in: SODA (2014)
Keyphrases
- approximation algorithms
- undirected graph
- constant factor
- np hard
- special case
- disjoint paths
- worst case
- minimum cost
- vertex cover
- graph structure
- facility location problem
- directed graph
- randomized algorithms
- random walk
- network design problem
- np hardness
- set cover
- open shop
- primal dual
- lower bound
- approximation ratio
- connected components
- weighted graph
- planar graphs
- constant factor approximation
- precedence constraints
- directed acyclic graph
- bipartite graph
- scheduling problem
- spanning tree
- upper bound
- computational complexity