Efficient routing in optical networks
From MaRDI portal
Publication:4371693
DOI10.1145/235809.235812zbMath0885.68083MaRDI QIDQ4371693
R. Ramaswami, Amotz Bar-Noy, Don Coppersmith, Baruch Schieber, Alok Aggarwal, Madhu Sudan
Publication date: 22 January 1998
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: http://www.acm.org/pubs/contents/journals/jacm/1996-43/
68Q25: Analysis of algorithms and problem complexity
Related Items
Rolling backwards can move you forward: On embedding problems in sparse expanders, The complexity of path coloring and call scheduling, Sparse and limited wavelength conversion in all-optical tree networks, Combinatorial constructions of fault-tolerant routings with levelled minimum optical indices, Wavelength routing of uniform instances in all-optical rings, ERCW PRAMs and optical communication, Routing permutations and involutions on optical ring networks: Complexity results and solution to an open problem, Path problems in generalized stars, complete graphs, and brick wall graphs