Fast Approximation Algorithms for p-Centers in Large $$\delta $$ δ -Hyperbolic Graphs.
Katherine EdwardsW. Sean KennedyIraj SanieePublished in: Algorithmica (2018)
Keyphrases
- approximation algorithms
- undirected graph
- special case
- np hard
- minimum cost
- network design problem
- primal dual
- approximation guarantees
- vertex cover
- worst case
- approximation schemes
- facility location problem
- set cover
- randomized algorithms
- graph model
- open shop
- approximation ratio
- constant factor
- constant factor approximation
- np hardness
- precedence constraints
- graph matching
- disjoint paths
- polynomial time approximation
- optimal solution