Approximation Algorithms for Minimum Size 2-Connectivity Problems.
Piotr KrystaV. S. Anil KumarPublished in: STACS (2001)
Keyphrases
- approximation algorithms
- constant factor
- vertex cover
- minimum cost
- randomized algorithms
- np hardness
- np hard
- approximation schemes
- exact algorithms
- facility location problem
- special case
- worst case
- np complete
- set cover
- constant factor approximation
- lower bound
- quadratic program
- primal dual
- convex optimization
- optimization problems
- simulated annealing