Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems.
Lisa FleischerKamal JainDavid P. WilliamsonPublished in: J. Comput. Syst. Sci. (2006)
Keyphrases
- approximation algorithms
- minimum cost
- vertex cover
- np hard
- undirected graph
- network flow problem
- special case
- minimum cost flow
- np hardness
- approximation schemes
- network design problem
- worst case
- randomized algorithms
- spanning tree
- network flow
- polynomially solvable
- np complete
- optimization problems
- primal dual
- approximation ratio
- search algorithm
- minimum cost path
- constant factor
- mixed integer programming
- weighted sum
- knapsack problem
- scheduling problem