A Set-Covering Approach for SONET Network Design
type: Dataset
description: 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
landing page: https://hal.science/hal-00082799
keyword: approximations
keyword: complexite
keyword: infoeu-reposemanticspreprint
keyword: infoinfo-dmcomputer-science-csdiscrete-mathematics-csdm
keyword: mathmath-comathematics-mathcombinatorics-mathco
keyword: preprints-working-papers-
keyword: recherche-operationnelle
keyword: set-covering
keyword: telecommunication-networks
issued: 2026-05-10T22:59:01.996485
modified: 2026-05-10T22:59:01.996490
language: en
contact point: Organization
  fn: CCSD

test_moissonnage_selune
type: Agent

A Set-Covering Approach for SONET Network Design
type: Distribution
format: HTML
access URL: https://hal.science/hal-00082799
issued: 2026-05-10T22:59:02.000743
modified: 2026-05-10T22:59:01.979667