A note on optical network with nonsplitting nodes

DOI10.1007/S10878-005-2273-YzbMath1093.90068OpenAlexW1996133549WikidataQ60402853 ScholiaQ60402853MaRDI QIDQ813337

Feng Wang, Yingshu Li, Hongwei David Du, My T. Thai, Xiao-Hua Jia

Publication date: 8 February 2006

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

Full work available at URL: https://doi.org/10.1007/s10878-005-2273-y

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18)

Related Items (4)

Directed Steiner trees with diffusion costs ⋮ Improved even order magic square construction algorithms and their applications in multi-user shared electronic accounts ⋮ Direction-Controlled DTI Interpolation ⋮ An approximation for minimum multicast route in optical networks with nonsplitting nodes

Cites Work

• Unnamed Item
• Unnamed Item
• Routing in sparse splitting optical networks with multicast traffic.

This page was built for publication: A note on optical network with nonsplitting nodes