Improved Approximation Algorithms for Minimum Weight Vertex Separators.
Uriel FeigeMohammadTaghi HajiaghayiJames R. LeePublished in: SIAM J. Comput. (2008)
Keyphrases
- minimum weight
- approximation algorithms
- np hard
- spanning tree
- greedy heuristic
- minimum cost
- bipartite graph
- special case
- weighted graph
- worst case
- vertex cover
- minimum spanning tree
- maximum cardinality
- randomized algorithms
- planar graphs
- approximation ratio
- undirected graph
- optimal solution
- randomized algorithm
- lower bound
- precedence constraints
- constant factor
- tree patterns
- greedy algorithm
- random variables
- upper bound