A Set-Covering Approach for SONET Network Design
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