A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems.
Eran HalperinUri ZwickPublished in: Random Struct. Algorithms (2002)
Keyphrases
- approximation algorithms
- vertex cover
- approximation schemes
- special case
- exact algorithms
- np hard
- np hardness
- undirected graph
- network design problem
- worst case
- disjoint paths
- set cover
- minimum cost
- evolutionary algorithm
- combinatorial optimization
- random walk
- graph structure
- bipartite graph
- greedy algorithm
- branch and bound
- directed graph
- facility location problem
- planar graphs
- np complete
- search space