Improved approximation algorithms for minimum-weight vertex separators.
Uriel FeigeMohammad Taghi HajiaghayiJames R. LeePublished in: STOC (2005)
Keyphrases
- minimum weight
- approximation algorithms
- np hard
- greedy heuristic
- spanning tree
- bipartite graph
- minimum cost
- vertex cover
- special case
- weighted graph
- worst case
- planar graphs
- undirected graph
- maximum cardinality
- minimum spanning tree
- approximation ratio
- greedy algorithm
- tree patterns
- randomized algorithm
- constant factor
- randomized algorithms
- computational complexity
- edge weights
- precedence constraints
- graph cuts
- linear programming
- upper bound
- objective function
- constant factor approximation