Approximation algorithms for network design with metric costs.
Joseph CheriyanAdrian VettaPublished in: STOC (2005)
Keyphrases
- approximation algorithms
- network design
- network design problem
- np hard
- special case
- vertex cover
- minimum cost
- communication networks
- network architecture
- worst case
- facility location
- approximation ratio
- primal dual
- randomized algorithms
- total cost
- open shop
- neural network
- set cover
- constant factor
- approximation schemes
- precedence constraints
- polynomial time approximation
- network flow
- constant factor approximation
- upper bound
- genetic algorithm