| Issue |
RAIRO-Oper. Res.
Volume 37, Number 4, October-December 2003
ROADEF 2002
|
|
|---|---|---|
| Page(s) | 235 - 247 | |
| DOI | https://doi.org/10.1051/ro:2004003 | |
| Published online | 15 March 2004 | |
Approximation algorithms for the design of SDH/SONET networks
1
Laboratoire Leibniz-IMAG, 46 avenue Félix Viallet, 38031 Grenoble Cedex, France; nadia.brauner@imag.fr., gerd.finke@imag.fr., pierre.lemaire@imag.fr.
2
École d'Administration des Affaires, Université de Liège, boulevard du Rectorat 7 (B31), 4000 Liège, Belgique;
y.crama@ulg.ac.be.
3
Electrabel Quantitive Analysis, 8 boulevard du Régent, 1000 Brussels, Belgique; christelle.wynants@electrabel.com.
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.
Key words: Graph partitioning / approximations / heuristics / tabu / SONET/SDH networks.
© EDP Sciences, 2003
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.