Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design.
Takuro FukunagaR. RaviPublished in: FOCS (2012)
Keyphrases
- approximation algorithms
- network design
- network design problem
- np hard
- undirected graph
- special case
- disjoint paths
- communication networks
- worst case
- vertex cover
- network architecture
- minimum cost
- primal dual
- set cover
- facility location
- approximation ratio
- open shop
- connected components
- constant factor
- genetic algorithm
- randomized algorithms
- multistage
- upper bound
- constant factor approximation