| A Set-Covering Approach for SONET Network Design (2006) | |||||||||||||
Abstract | |||||||||||||
| 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\'atal for this particular case. \bigskip | |||||||||||||
Publication details | |||||||||||||
| |||||||||||||