An optimal path selection algorithm for static and mobile multicast routing problems

DOI10.1007/3-540-45803-4_18MaRDI QIDQ3044908zbMATH OpenFDO

Authors Shigeto Tajima, Masakazu Fujii, Nobuo Funabiki, Tokumi Yokohira, Kazufumi Tsunemura, Teruo Higashino

Publication date 12 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2343/23430193.htm

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computing methodologies and applications (68U99)

Recommendations

• Algorithms for multicast connection under multi-path routing model.
• Branch-and-price algorithm for a multicast routing problem
• scientific article; zbMATH DE number 5257271
• A multicast routing algorithm based on tabu search
• An improved approximation algorithm for multicast \(k\)-tree routing

Cited in

(2)

• A survey of combinatorial optimization problems in multicast routing
• A graph-based approach to compute multiple paths in mobile ad hoc networks

This page was built for publication: An optimal path selection algorithm for static and mobile multicast routing problems

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