Algorithms for multicast connection under multi-path routing model.

DOI10.1016/S0020-0190(02)00220-XzbMath1042.68005OpenAlexW2045864518MaRDI QIDQ1853101

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

Publication date: 21 January 2003

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

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

zbMATH Keywords

Approximation algorithmsRouting algorithmsMulticast connectionNetwork cost

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Network design and communication in computer systems (68M10)

Related Items (5)

Routing algorithm for multicast under multi-tree model in optical networks ⋮ An improved approximation algorithm for capacitated multicast routings in networks ⋮ A 3.4713-approximation algorithm for the capacitated multicast tree routing problem ⋮ An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem ⋮ An improved approximation algorithm for multicast \(k\)-tree routing

Cites Work

• Unnamed Item
• A fast algorithm for Steiner trees
• A Greedy Heuristic for the Set-Covering Problem
• Routing to Multiple Destinations in Computer Networks

This page was built for publication: Algorithms for multicast connection under multi-path routing model.