Reference : Approximation algorithms for the design of SDH/SONET networks
Scientific journals : Article
Engineering, computing & technology : Multidisciplinary, general & others
http://hdl.handle.net/2268/1734
Approximation algorithms for the design of SDH/SONET networks
English
Brauner, Nadia [> > > >]
Crama, Yves mailto [Université de Liège - ULg > HEC - Ecole de gestion de l'ULg > Recherche opérationnelle et gestion de la production >]
Finke, Gerd [> > > >]
Lemaire, Pierre [> > > >]
Wynants, Christelle [Université de Liège - ULg > > HEC-Ecole de gestion de l'ULg >]
2003
RAIRO : Operations Research = Recherche Opérationnelle
E D P Sciences
37
4, OCT-DEC
235-247
Yes (verified by ORBi)
International
0399-0559
1290-3868
Les Ulis Cedexa
[en] graph partitioning ; approximations ; heuristics ; tabu ; SONET/SDH networks
[en] 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.
Researchers
http://hdl.handle.net/2268/1734
10.1051/ro:2004003

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
SONET Abstract.pdfAbstractPublisher postprint65.34 kBView/Open
Restricted access
solvingADR.pdfNo commentaryAuthor postprint190.53 kBRequest copy

Bookmark and Share SFX Query

All documents in ORBi are protected by a user license.