Bandwidth maximization in multicasting

DOI10.1007/B13632MaRDI QIDQ5897250zbMATH OpenOpenAlexFDO

Authors Naveen Garg, Rohit Khandekar, Keshav Kunal, Vinayaka Pandit

Publication date 3 March 2010

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

Full work available at URL https://doi.org/10.1007/b13632

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25)

Recommendations

• SOFSEM 2005: Theory and Practice of Computer Science
• Optimum and multicast of multimedia streams
• A 3.4713-approximation algorithm for the capacitated multicast tree routing problem
• Algorithms for multicast connection under multi-path routing model.
• An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem

Cited in

(6)

• A bandwidth latency tradeoff for broadcast and reduction
• Optimum and multicast of multimedia streams
• A note on practical construction of maximum bandwidth paths.
• scientific article; zbMATH DE number 5454665 (Why is no real title available?)
• Bandwidth-Delay Constrained Least Cost Multicast Routing for Multimedia Communication
• Maximum Bandwidth Under Edge Addition

This page was built for publication: Bandwidth maximization in multicasting

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