Approximation Algorithms for Buy-at-Bulk Geometric Network Design.
Artur CzumajJurek CzyzowiczLeszek GasieniecJesper JanssonAndrzej LingasPawel ZylinskiPublished in: Int. J. Found. Comput. Sci. (2011)
Keyphrases
- approximation algorithms
- network design
- network design problem
- np hard
- special case
- worst case
- vertex cover
- communication networks
- open shop
- constant factor
- minimum cost
- primal dual
- polynomial time approximation
- network architecture
- set cover
- randomized algorithms
- facility location
- approximation schemes
- constant factor approximation
- approximation ratio
- undirected graph
- combinatorial auctions
- search algorithm
- precedence constraints
- branch and bound
- neural network