The SONET Edge-Partition Problem

Networks

Volumn 41, Issue 1, 2003, Pages 13-23

  Goldschmidt, Olivier ^a   Hochbaum, Dorit S ^b   Levin, Asaf ^c   Olinick, Eli V ^d  

^a OPNET Technologies Inc   (United States)

^b DEPARTMENT OF INDUSTRIAL ENGINEERING AND OPERATIONS RESEARCH   (United States)

^c TEL AVIV UNIVERSITY   (Israel)

^d Southern Methodist University   (United States)

Author keywords

Approximation algorithms; Combinatorial optimization; Equipment placement in SONET rings; Graph partitioning; Survivable network design; Telecommunications networks

Indexed keywords

APPROXIMATION ALGORITHMS; COMBINATORIAL OPTIMIZATION; EQUIPMENT PLACEMENT IN SONET RINGS; GRAPH PARTITIONING; SURVIVAL NETWORK DESIGN;

ALGORITHMS; APPROXIMATION THEORY; DESIGN; GRAPH THEORY; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

TELECOMMUNICATION NETWORKS;

EID: 2142670680     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.10054     Document Type: Article

References (7)

1. A. Aho, J. Hopcroft, and J. Ullman, The design and analysis of computer algorithms, Addison-Wesley, Reading, MA, 1974.
2. D. Dor and M. Tarsi, Graph decomposition is NP-complete: A complete proof of Holyer's conjecture, SIAM J Comput 26 (1997), 1166-1187.
3. I. Holyer, The NP-completeness of some edge-partition problems, SIAM J Comput 10 (1981), 713-717.
4. J. Hopcroft and R. Tarjan, Efficient algorithms for graph manipulation, Commun ACM 16 (1973), 372-378.
5. Y. Lee, H. Sherali, J. Han, and S. Kim, A branch-and-cut algorithm for solving an intra-ring synchronous optical network design problem, Networks 35 (2000), 223-232.
6. S. Masuyama and T. Ibaraki, Chain packing in graphs, Algorithmica 6 (1991), 826-839.
7. A. Sutter, F. Vanderbeck, and L. Wolsey, Optimal placement of add/drop multiplexers: Heuristic and exact algorithms, Oper Res 46 (1998), 719-728.