We present a fully polynomial-time approximation scheme for a multicommodity flow problem that yields lower bounds of the graph bisection problem. We compare the approximation algorithm with Lagrangian relaxation based costdecomposition approaches and linear programming software when embedded in an exact branch&bound approach for graph bisection. It is shown that the approximation algorithm is clearly superior in this context. Furthermore, we present a new practical addition to the approximation algorithm which improves its performance distinctly. Finally, we prove the performance of the graph bisection algorithm using multicommodity flow approximation by computing formerly unknown bisection widths of some DeBruijn- and Shuffle-Exchange-Graphs. © Springer-Verlag 2003.
CITATION STYLE
Sellmann, M., Sensen, N., & Timajev, L. (2003). Multicommodity flow approximation used for exact graph partitioning. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2832, 752–764. https://doi.org/10.1007/978-3-540-39658-1_67
Mendeley helps you to discover research relevant for your work.