Article contents
Approximation algorithms for the design of SDH/SONET networks
Published online by Cambridge University Press: 15 March 2004
Abstract
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.
- Type
- Research Article
- Information
- Copyright
- © EDP Sciences, 2003
References
- 9
- Cited by