An approximation for minimum multicast route in optical networks with nonsplitting nodes

DOI10.1007/S10878-005-4925-3MaRDI QIDQ2583176zbMATH OpenOpenAlexFDO

Authors Longjiang Guo, Weili Wu, Feng Wang, My T. Thai

Publication date 13 January 2006

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-005-4925-3

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Communication networks in operations research (90B18) Programming involving graphs or networks (90C35)

Recommendations

• A note on optical network with nonsplitting nodes
• On the minimum number of wavelengths in multicast trees in WDM networks
• An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem
• Size-constrained tree partitioning: approximating the multicast k-tree routing problem
• Computing and Combinatorics

Cites work

• A note on optical network with nonsplitting nodes
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1445376 (Why is no real title available?)
• New approximation algorithms for the Steiner tree problems
• Routing in sparse splitting optical networks with multicast traffic.

Cited in

(7)

• Routing in sparse splitting optical networks with multicast traffic.
• Finslerian diffusion and the Bloch-Torrey equation
• Directed Steiner trees with diffusion costs
• An $\Omega(\sqrt{\,\log\log n}\,)$ Lower Bound for Routing in Optical Networks
• Path decomposition under a new cost measure with applications to optical network design
• Algorithms – ESA 2004
• A note on optical network with nonsplitting nodes

This page was built for publication: An approximation for minimum multicast route in optical networks with nonsplitting nodes

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