Algorithms for multicast connection under multi-path routing model.

DOI10.1016/S0020-0190(02)00220-XMaRDI QIDQ1853101zbMATH OpenOpenAlexFDO

Authors J. Gu, Xiaodong Hu, 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)

Recommendations

• Routing algorithm for multicast under multi-tree model in optical networks
• scientific article; zbMATH DE number 2202244

Cites work

• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• A Greedy Heuristic for the Set-Covering Problem
• A fast algorithm for Steiner trees
• Routing to Multiple Destinations in Computer Networks

Cited in

(10)

• An improved approximation algorithm for capacitated multicast routings in networks
• An improved approximation algorithm for multicast \(k\)-tree routing
• scientific article; zbMATH DE number 2088470 (Why is no real title available?)
• scientific article; zbMATH DE number 1981018 (Why is no real title available?)
• An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem
• A 3.4713-approximation algorithm for the capacitated multicast tree routing problem
• Bandwidth maximization in multicasting
• scientific article; zbMATH DE number 2202244 (Why is no real title available?)
• Routing algorithm for multicast under multi-tree model in optical networks
• Anycasting in connection-oriented computer networks: Models, algorithms and results

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

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