| Autor: |
Brauner, Nadia, Crama, Yves, Finke, Gerd, Lemaire, Pierre, Wynants, Christelle |
| Zdroj: |
RAIRO - Operations Research; October 2003, Vol. 37 Issue: 4 p235-247, 13p |
| Abstrakt: |
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. |
| Databáze: |
Supplemental Index |
| Externí odkaz: |
|
