Mathematical Programming

, Volume 95, Issue 1, pp 91–101 | Cite as

Graph partitioning using linear and semidefinite programming

  • A. Lisser
  • F. Rendl

Abstract.

 Graph partition is used in the telecommunication industry to subdivide a transmission network into small clusters. We consider both linear and semidefinite relaxations for the equipartition problem and present numerical results on real data from France Telecom networks with up 900 nodes, and also on randomly generated problems.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • A. Lisser
    • 1
  • F. Rendl
    • 2
  1. 1.Laboratorie de Recherche en Informatique, Université Paris Sud, Orsay Cedex FranceFR
  2. 2.Institut für Mathematik, Universität Klagenfurt, A – 9020 Klagenfurt, AustriaAT

Personalised recommendations