Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design.
Raja JothiBalaji RaghavachariPublished in: ACM Trans. Algorithms (2005)
Keyphrases
- approximation algorithms
- network design
- network design problem
- np hard
- communication networks
- special case
- vertex cover
- minimum cost
- worst case
- facility location
- approximation ratio
- network architecture
- spanning tree
- constant factor
- open shop
- set cover
- primal dual
- precedence constraints
- minimum spanning tree
- scheduling problem
- combinatorial auctions
- polynomial time approximation
- genetic algorithm
- neural network
- randomized algorithms