A note on optical routing on trees

DOI10.1016/S0020-0190(97)00077-XzbMATH Open1336.68135OpenAlexW2062769315MaRDI QIDQ287098FDOQ287098

Authors: S. Ravi Kumar, Rina Panigrahy, Alexander Russell, Ravi Sundaram 

Publication date: 26 May 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(97)00077-x

Recommendations

• Efficient wavelength routing on directed fiber trees
• scientific article; zbMATH DE number 1820026
• Optimal wavelength routing on directed fiber trees
• scientific article; zbMATH DE number 1862254
• Efficient algorithms for wavelength assignment on trees of rings

zbMATH Keywords

computational complexityinterconnection networkscombinatorial problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Communication networks in operations research (90B18)

Cites Work

• Integer Programming with a Fixed Number of Variables
• The NP-Completeness of Edge-Coloring
• The Complexity of Coloring Circular Arcs and Chords
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (13)

• Parameterized maximum path coloring
• Optical Routing of Uniform Instances in Cayley Graphs
• A \(\frac{5}{2}\)-approximation algorithm for coloring rooted subtrees of a degree 3 tree
• The complexity of path coloring and call scheduling
• On spectrum assignment in elastic optical tree-networks
• Resource allocation in bounded degree trees
• Efficient wavelength routing on directed fiber trees
• Parameterized maximum path coloring
• The permutation-path coloring problem on trees.
• An $\Omega(\sqrt{\,\log\log n}\,)$ Lower Bound for Routing in Optical Networks
• Improved algorithms for scheduling unsplittable flows on paths
• The undirected optical indices of complete \(m\)-ary trees
• Routing permutations and involutions on optical ring networks: Complexity results and solution to an open problem

This page was built for publication: A note on optical routing on trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q287098)