Approximation algorithms for node-weighted buy-at-bulk network design.
Chandra ChekuriMohammad Taghi HajiaghayiGuy KortsarzMohammad R. SalavatipourPublished in: SODA (2007)
Keyphrases
- approximation algorithms
- network design
- network design problem
- undirected graph
- np hard
- special case
- communication networks
- vertex cover
- disjoint paths
- worst case
- minimum cost
- network architecture
- open shop
- primal dual
- facility location
- constant factor
- directed graph
- set cover
- approximation ratio
- genetic algorithm
- linear programming
- edge weights
- randomized algorithms
- search algorithm
- graph structure
- search space
- upper bound
- precedence constraints
- combinatorial auctions