Approximation Algorithms for Constructing Wavelength Routing Networks

Networks

Volumn 40, Issue 1, 2002, Pages 32-37

  Hassin, Refael ^a   Levin, Asaf ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Network synthesis; Wavelength routing; WDM

Indexed keywords

ALGORITHMS; GRAPH THEORY; ROUTERS; WAVELENGTH DIVISION MULTIPLEXING;

WAVELENGTH ROUTING;

TELECOMMUNICATION NETWORKS;

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

References (10)

1. C. Berge, Graphs and hypergraphs, North-Holland, Amsterdam, 1973.
2. I. Caragiannis, C. Kaklamanis, and P. Persiano, Wavelength routing in all-optical tree networks: A survey, Comput Artific Intell, to appear.
3. I. Caragiannis, C. Kaklamanis, and P. Persiano, Wavelength routing of symmetric communication requests in directed fiber trees, Proc 5th Int Colloq on Structural Information and Communication Complexity (SIROCCO 98), 1998, pp. 1019. Also, Symmetric communication in all-optical tree networks, Parallel Process Lett, to appear.
4. I. Caragiannis, C. Kaklamanis, and P. Persiano, Wavelength routing of symmetric communication requests in directed fiber trees, Proc 5th Int Colloq on Structural Information and Communication Complexity (SIROCCO 98), 1998, pp. 1019. Also, Symmetric communication in all-optical tree networks, Parallel Process Lett, to appear.
5. T. Erlebach and K. Jansen, Scheduling of virtual connections in fast networks, Proc 4th Workshop on Parallel Systems and Algorithms, PASA 96, 1996, 13-32.
6. S. Even and R.E. Tarjan, Network flow and testing graph connectivity, SIAM J Comput 4 (1975), 507-518.
7. I. Holyer, The NP-completeness of some edge partition problems, SIAM J Comput 10 (1981), 713-717.
8. I. Holyer, The NP-completeness of edge-coloring, SIAM J Comput 10 (1981), 718-720.
9. Z. Galil and D. Leven, NP-completeness of finding the chromatic index of regular graphs, J Alg 4 (1983), 35-44.
10. L. Lovász and M.D. Plummer, Matching theory, Elsevier, Amsterdam, 1986.