NC Approximation Algorithms for 2-Connectivity Augmentation in a Graph.
Weifa LiangGeorge HavasPublished in: Euro-Par (1997)
Keyphrases
- approximation algorithms
- undirected graph
- connected components
- disjoint paths
- constant factor
- np hard
- special case
- worst case
- vertex cover
- graph connectivity
- facility location problem
- minimum cost
- graph structure
- primal dual
- random walk
- np hardness
- strongly connected
- graph model
- spanning tree
- directed graph
- open shop
- network design problem
- approximation ratio
- constant factor approximation
- set cover
- precedence constraints
- lower bound
- weighted graph
- approximation schemes
- scheduling problem
- optimal solution
- objective function
- combinatorial auctions
- planar graphs
- randomized algorithms
- strongly np hard
- bipartite graph