Approximation Algorithms for Buy-at-Bulk Geometric Network Design.
Artur CzumajJurek CzyzowiczLeszek GasieniecJesper JanssonAndrzej LingasPawel ZylinskiPublished in: WADS (2009)
Keyphrases
- approximation algorithms
- network design
- network design problem
- np hard
- special case
- vertex cover
- worst case
- communication networks
- network architecture
- set cover
- minimum cost
- randomized algorithms
- approximation schemes
- facility location
- open shop
- constant factor
- precedence constraints
- primal dual
- approximation ratio
- combinatorial auctions
- linear program
- linear programming
- neural network