Approximation algorithms for the design of SDH/SONET networks
Nadia Brauner, Yves Crama, Gerd Finke, Pierre Lemaire, Christelle Wynants (2010)
RAIRO - Operations Research
Similarity:
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.