Fast approximation algorithms for the diameter and radius of sparse graphs.
Liam RodittyVirginia Vassilevska WilliamsPublished in: STOC (2013)
Keyphrases
- approximation algorithms
- undirected graph
- np hard
- special case
- worst case
- minimum cost
- vertex cover
- approximation guarantees
- approximation ratio
- spanning tree
- open shop
- facility location problem
- primal dual
- network design problem
- np hardness
- set cover
- precedence constraints
- constant factor
- graph matching
- randomized algorithms
- greedy algorithm
- disjoint paths
- graph model
- integer programming
- bipartite graph
- approximation schemes
- directed graph
- constant factor approximation