Approximation via cost sharing: Simpler and better approximation algorithms for network design.
Anupam GuptaAmit KumarMartin PálTim RoughgardenPublished in: J. ACM (2007)
Keyphrases
- approximation algorithms
- network design
- network design problem
- approximation ratio
- np hard
- special case
- vertex cover
- constant factor approximation
- communication networks
- approximation schemes
- minimum cost
- worst case
- polynomial time approximation
- facility location
- set cover
- facility location problem
- randomized algorithms
- constant factor
- primal dual
- network architecture
- open shop
- integrality gap
- undirected graph
- precedence constraints
- computational complexity
- disjoint paths
- network structure
- branch and bound algorithm