Fast Approximation Algorithms for p-centers in Large \delta δ -hyperbolic Graphs.
Katherine EdwardsW. Sean KennedyIraj SanieePublished in: WAW (2016)
Keyphrases
- approximation algorithms
- undirected graph
- np hard
- special case
- worst case
- vertex cover
- facility location problem
- network design problem
- graph matching
- set cover
- minimum cost
- np hardness
- approximation guarantees
- approximation schemes
- open shop
- approximation ratio
- precedence constraints
- disjoint paths
- spanning tree
- graph structure
- primal dual
- randomized algorithms
- directed graph
- objective function
- combinatorial auctions
- constant factor
- graph model
- polynomial time approximation
- bipartite graph