A Set-Covering Approach for SONET Network Design - Archive ouverte HAL
Pré-Publication, Document De Travail Année : 2002

A Set-Covering Approach for SONET Network Design

Nadia Brauner
Pierre Lemaire

Résumé

In this paper we formalize a graph-partitioning problem that arises in the design of SONET networks as a Set-Covering problem. We then improve the general performance ratio of the Greedy Algorithm proved by Chvátal for this particular case. \bigskip
Fichier principal
Vignette du fichier
CLLeib62.pdf (885.32 Ko) Télécharger le fichier

Dates et versions

hal-00082799 , version 1 (28-06-2006)

Identifiants

  • HAL Id : hal-00082799 , version 1

Citer

Nadia Brauner, Pierre Lemaire. A Set-Covering Approach for SONET Network Design. 2002. ⟨hal-00082799⟩
133 Consultations
171 Téléchargements

Partager

More