Routing algorithm for multicast under multi-tree model in optical networks

DOI10.1016/j.tcs.2003.12.019zbMath1070.68008OpenAlexW2092603347WikidataQ60402967 ScholiaQ60402967MaRDI QIDQ1884928

Mu-Hong Zhang, Jun Gu, Xiao-Dong Hu, Xiao-Hua Jia

Publication date: 27 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2003.12.019

zbMATH Keywords

RoutingMulticastWavelength assignmentMulti-tree modelOptical networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (6)

Size-constrained tree partitioning: approximating the multicast \(k\)-tree routing problem ⋮ Inapproximability and approximability of minimal tree routing and coloring ⋮ An improved approximation algorithm for capacitated multicast routings in networks ⋮ Inapproximability and approximability of maximal tree routing and coloring ⋮ A 3.4713-approximation algorithm for the capacitated multicast tree routing problem ⋮ An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem

Cites Work

• Algorithms for multicast connection under multi-path routing model.
• Steiner tree problems
• Unnamed Item

This page was built for publication: Routing algorithm for multicast under multi-tree model in optical networks