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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: August 8, 2001 / Accepted: November 9, 2001 Published online: December 9, 2002
RID="★★"
ID="★★" This research was carried out while this author was working at France Telecom R & D, 38–40 rue du Général Leclerc, F-92794 Issy-Les-Moulineaux Cedex 9, France.
RID="★"
ID="★" This author greatfully acknowledges financial support from the Austrian Science Foundation FWF Project P12660-MAT.
Key words. graph partitioning – semidefinite programming
Rights and permissions
About this article
Cite this article
Lisser, A., Rendl, F. Graph partitioning using linear and semidefinite programming. Math. Program., Ser B 95, 91–101 (2003). https://doi.org/10.1007/s10107-002-0342-x
Issue Date:
DOI: https://doi.org/10.1007/s10107-002-0342-x