Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design.
Takuro FukunagaZeev NutovR. RaviPublished in: SIAM J. Comput. (2015)
Keyphrases
- approximation algorithms
- network design
- network design problem
- np hard
- undirected graph
- special case
- communication networks
- disjoint paths
- worst case
- minimum cost
- vertex cover
- primal dual
- approximation ratio
- network architecture
- set cover
- facility location
- randomized algorithms
- open shop
- combinatorial auctions
- constant factor
- polynomial time approximation
- directed graph
- upper bound
- connected components
- computer systems
- graph structure