Iterative rounding approximation algorithms for degree-bounded node-connectivity network design
Takuro FukunagaR. RaviPublished in: CoRR (2012)
Keyphrases
- approximation algorithms
- network design
- network design problem
- undirected graph
- np hard
- disjoint paths
- special case
- worst case
- vertex cover
- minimum cost
- communication networks
- network architecture
- open shop
- connected components
- set cover
- primal dual
- facility location
- approximation ratio
- constant factor
- constant factor approximation
- directed graph
- graph structure
- polynomial time approximation
- optimal solution
- branch and bound algorithm
- search space