The ring loading problem

SIAM Journal on Discrete Mathematics

Volumn 11, Issue 1, 1998, Pages 1-14

  Schrijver, Alexander ^a   Seymour, Paul ^b   Winkler, Peter ^c  

^a CWI   (Netherlands)

^b PRINCETON UNIVERSITY   (United States)

^c LUCENT TECHNOLOGIES   (United States)

Author keywords

Load balancing; Optical network design; SONET ring

Indexed keywords

EID: 0001904667     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480195294994     Document Type: Article

References (10)

1. J. BABCOCK, SONET: A practical perspective, Business Comm. Rev., Sept. (1990), pp. 59-63.
2. S. COSARES, I. SANIEE, AND O. WASEM, Network planning with the SONET toolkit, Bellcore EXCHANGE, Sept./Oct. (1992), pp. 8-13.
3. S. COSARES AND I. SANIEE, An optimization problem related to balancing loads on SONET rings, Telecommunications Systems, 3 (1994), pp. 165-181.
4. A. FRANK, Connectivity and network flows, in Handbook of Combinatorics, R. Graham, M. Grötschel, and L. Lovász, eds., Elsevier, Amsterdam, 1995, pp. 111-177.
5. A. FRANK, Edge-disjoint paths in planar graphs, J. Combin. Theory Ser. B, 38 (1985), pp. 164-178.
6. A. FRANK, T. NISHIZEKI, N. SAITO, H. SUZUKI, AND E. TARDOS, Algorithms for routing around a rectangle, Discrete Appl. Math., 40 (1992), pp. 363-378.
7. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, 1979.
8. L. G. KHACHIYAN, A polynomial algorithm in linear programming, Soviet Math. Dokl., 20 (1979), pp. 191-194.
9. H. OKAMURA AND P. D. SEYMOUR, Multicommodity flows in planar graphs, J. Combin. Theory Ser. B, 31 (1981), pp. 75-81.
10. H. RIPPHAUSEN-LIPA, D. WAGNER, AND K. WEIHE, Efficient algorithms for disjoint paths in planar graphs, in Combinatorial Optimization, DIMACS Series in Discrete Math. Theoret. Comput. Sci. 20, W. Cook, L. Lovász, and P. Seymour, eds., AMS, Providence, RI, 1995, pp. 295-354.