Approximation algorithms for the design of SDH/SONET networks

in RAIRO : Operations Research = Recherche Opérationnelle (2003), 37(4, OCT-DEC), 235-247

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 ... [more ▼]

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. [less ▲]