Multicommodity Flow Approximation used for Exact Graph Partitioning ?

  • Meinolf Sellmanny, Norbert Sensenz, Larissa Timajevz
  • Published 2003

Abstract

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 cost-decomposition approaches and linear programming software when embedded in an exact branch&bound approach for graph bisection. It is… (More)

Topics

3 Figures and Tables

Cite this paper

@inproceedings{Sellmanny2003MulticommodityFA, title={Multicommodity Flow Approximation used for Exact Graph Partitioning ?}, author={Meinolf Sellmanny and Norbert Sensenz and Larissa Timajevz}, year={2003} }