A Static 2-Approximation Algorithm for Vertex Connectivity and Incremental Approximation Algorithms for Edge and Vertex Connectivity.
Monika Rauch HenzingerPublished in: J. Algorithms (1997)
Keyphrases
- approximation algorithms
- undirected graph
- approximation ratio
- np hard
- worst case
- vertex cover
- special case
- polynomial time approximation
- open shop
- primal dual
- strongly connected
- learning algorithm
- constant factor approximation
- triangle mesh
- approximation guarantees
- constant factor
- disjoint paths
- convergence rate
- dynamic programming
- vertex set
- randomized algorithms
- optimal solution
- integrality gap
- search algorithm
- closest string
- upper bound
- minimum weight
- theoretical analysis
- facility location problem
- connected components
- np hardness
- exact algorithms
- simulated annealing
- tabu search
- search space
- computational complexity
- error bounds
- greedy algorithm
- knapsack problem