Improved Approximation Algorithms for Maximum Graph Partitioning Problems.

Gerold Jäger Anand Srivastav

Published in: FSTTCS (2004)

Keyphrases

approximation algorithms
graph partitioning
vertex cover
np hard
worst case
randomized algorithms
special case
minimum cost
np complete
partitioning algorithm
image segmentation
object recognition
k means
information theoretic