A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We obtain improved semidefinite programming based approximation algorithms for all the natural maximum bisection problems of graphs. Among the problems considered are: MAX n/2-BISECTION -partition the vertices of a graph into two sets of equal size such that the total weight of edges connecting vertices from different sides is maximized; MAX n/2-VERTEX-COVER - find a set containing half of the vertices such that the total weight of edges touching this set is maximized; MAX n/2-DENSE-SUBGRAPH - find a set containing half of the vertices such that the total weight of edges connecting two vertices from this set is maximized; and MAX n/2-UnCUT - partition the vertices into two sets of equal size such that the total weight of edges that do not cross the cut is maximized. We also consider the directed versions of these problems, MAX n/2-DIRECTED-BISECTION and MAX n/2-DIRECTED-UnCUT. These results can be used to obtain improved approximation algorithms for the unbalanced versions of the partition problems mentioned above, where we want to partition the graph into two sets of size k and n — k, where k is not necessarily f. Our results improve, extend and unify results of Frieze and Jerrum, Feige and Langberg, Ye, and others.

Original languageEnglish
Title of host publicationInteger Programming and Combinatorial Optimization - 8th International IPCO Conference, Proceedings
EditorsKaren Aardal, Bert Gerards
PublisherSpringer Verlag
Pages210-225
Number of pages16
ISBN (Print)3540422250, 9783540422259
DOIs
StatePublished - 2001
Event8th International Integer Programming and Combinatorial Optimization Conference, IPCO 2001 - Utrecht, Netherlands
Duration: 13 Jun 200115 Jun 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2081
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference8th International Integer Programming and Combinatorial Optimization Conference, IPCO 2001
Country/TerritoryNetherlands
CityUtrecht
Period13/06/0115/06/01

Fingerprint

Dive into the research topics of 'A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems'. Together they form a unique fingerprint.

Cite this