Approximation algorithms for the design of SONET networks

Nadia Brauner (1) , Yves Crama (2) , Gerd Finke (1) , Pierre Lemaire (1) , Christelle Wynants (3)

1 Leibniz - IMAG - Laboratoire Leibniz
2 École d'Administration des Affaires, Université de Liège
3 Electrabel Quantitative Analysis

In this paper a graph-partitioning problem that arises in the design of SONET/SDH networks is defined and formalized. Approximation algorithms with performance guarantees are presented. To solve this problem efficiently in practice, fast greedy algorithms and a tabu-search method are proposed and analyzed by means of an experimental study

Mots clés: SONET networks; approximation algorithms; tabu-search

Domaines: Recherche opérationnelle [math.OC]

Nadia Brauner, Yves Crama, Gerd Finke, Pierre Lemaire, Christelle Wynants. Approximation algorithms for the design of SONET networks. RAIRO - Operations Research, 2003, 37 (4), pp.235-247. ⟨10.1051/ro:2004003⟩. ⟨hal-00358567⟩