Fast approximation algorithms for $p$-centres in large $δ$-hyperbolic graphs.
Katherine EdwardsW. Sean KennedyIraj SanieePublished in: CoRR (2016)
Keyphrases
- approximation algorithms
- undirected graph
- np hard
- special case
- vertex cover
- approximation guarantees
- facility location problem
- worst case
- randomized algorithms
- network design problem
- minimum cost
- primal dual
- constant factor
- approximation schemes
- approximation ratio
- constant factor approximation
- open shop
- directed graph
- set cover
- precedence constraints
- combinatorial auctions
- graph structure
- search algorithm
- np hardness
- graph model
- bipartite graph
- random walk
- disjoint paths