A Unified Framework for Obtaining Improved Approximation Algorithms for Maximum Graph Bisection Problems.

Eran Halperin Uri Zwick

Published in: IPCO (2001)

Keyphrases

approximation algorithms
vertex cover
np hard
randomized algorithms
special case
np hardness
np complete
minimum cost
network design problem
approximation schemes
exact algorithms
undirected graph
optimization problems
disjoint paths
polynomial time approximation
practical problems
spanning tree
random walk