A Set-Covering Approach for SONET Network Design

Nadia Brauner (1) , Pierre Lemaire

1 Leibniz - IMAG - Laboratoire Leibniz

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

Mots clés: complexité; recherche opérationnelle; set-covering; approximations; telecommunication networks

Domaines: Mathématique discrète [cs.DM]; Combinatoire [math.CO]

Nadia Brauner, Pierre Lemaire. A Set-Covering Approach for SONET Network Design. 2002. ⟨hal-00082799⟩