Approximation Algorithms for Graph Augmentation.
Samir KhullerRamakrishna ThurimellaPublished in: J. Algorithms (1993)
Keyphrases
- approximation algorithms
- undirected graph
- np hard
- constant factor
- special case
- disjoint paths
- vertex cover
- minimum cost
- facility location problem
- worst case
- randomized algorithms
- primal dual
- approximation ratio
- approximation schemes
- connected components
- open shop
- network design problem
- np hardness
- directed graph
- set cover
- spanning tree
- bipartite graph
- random walk
- polynomial time approximation
- graph model
- max flow
- graph structure
- lower bound