ALCOMFT-TR-01-88

Norbert Sensen
Lower Bounds and Exact Algorithms for the Graph Partitioning Problem using Multicommodity Flows
Paderborn. Work package 2. May 2001.

Abstract: In this paper new and generalized lower bounds for the graph partitioning problem are presented. These bounds base on the well known lower bound of embedding a clique into the given graph with minimal congestion which is equivalent to a multicommodity flow problem where each vertex sends a commodity of size one to every other vertex. Our new bounds use arbitrary multicommodity flow instances for the bound calculation, the critical point for the lower bound is the guaranteed cut flow of the instances. Furthermore, a branch&bound procedure basing on these bounds is presented. Finally, upper bounds of the lower bounds are shown which demonstrate the superiority of the presented generalizations; and the new bounds are applied to the Butterfly and Bene\vs network.

Postscript file: ALCOMFT-TR-01-88.ps.gz (83 kb).