A note on optical routing on trees

DOI10.1016/S0020-0190(97)00077-XzbMath1336.68135OpenAlexW2062769315MaRDI QIDQ287098

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

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

zbMATH Keywords

computational complexitycombinatorial problemsinterconnection networks

Mathematics Subject Classification ID

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

Related Items (7)

Parameterized Maximum Path Coloring ⋮ Parameterized maximum path coloring ⋮ A \(\frac{5}{2}\)-approximation algorithm for coloring rooted subtrees of a degree 3 tree ⋮ The permutation-path coloring problem on trees. ⋮ Improved algorithms for scheduling unsplittable flows on paths ⋮ The complexity of path coloring and call scheduling ⋮ Resource allocation in bounded degree trees

Cites Work

• Integer Programming with a Fixed Number of Variables
• The NP-Completeness of Edge-Coloring
• The Complexity of Coloring Circular Arcs and Chords
• Unnamed Item
• Unnamed Item

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