Approximation Algorithms for the Capacitated Minimum Spanning Tree Problem and Its Variants in Network Design.
Raja JothiBalaji RaghavachariPublished in: ICALP (2004)
Keyphrases
- approximation algorithms
- network design
- network design problem
- np hard
- special case
- communication networks
- worst case
- minimum cost
- vertex cover
- undirected graph
- network architecture
- approximation ratio
- facility location
- set cover
- randomized algorithms
- constant factor
- precedence constraints
- lower bound
- polynomial time approximation
- primal dual
- objective function
- distributed environment
- upper bound
- spanning tree
- genetic algorithm
- integer programming
- supply chain