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