Approximation Algorithms for the Minimum Cardinality Two-Connected Spanning Subgraph Problem.
Prabhakar GubbalaBalaji RaghavachariPublished in: IPCO (2005)
Keyphrases
- approximation algorithms
- np hard
- minimum cost
- constant factor
- special case
- vertex cover
- np hardness
- worst case
- lower bound
- primal dual
- facility location problem
- approximation ratio
- randomized algorithms
- network design problem
- branch and bound algorithm
- network flow
- exact algorithms
- scheduling problem
- set cover
- optimal solution
- open shop
- approximation schemes
- integer programming
- precedence constraints
- undirected graph
- polynomial time approximation
- constraint satisfaction problems
- search space
- computational complexity