Multicommodity Multicast, Wireless and Fast

DOI10.4230/LIPICS.ESA.2019.78MaRDI QIDQ5075826zbMATH OpenOpenAlexFDO

Authors R. Ravi, Oleksandr Rudenko

Publication date 11 May 2022

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2019/11199/pdf/LIPIcs-ESA-2019-78.pdf/

zbMATH Keywords

approximationbroadcastmulticastmulticommodityoptimization algorithmspacket routingrumorscheduling

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Sending secrets swiftly: approximation algorithms for generalized multicast problems
• Rumors across radio, wireless, telephone
• Plane gossip: approximating rumor spread in planar graphs
• scientific article; zbMATH DE number 2079323
• Sublogarithmic approximation for telephone multicast

Cites work

• A Cure for the Telephone Disease
• A survey of gossiping and broadcasting in communication networks
• Broadcast Time in Communication Networks
• Fast broadcasting and gossiping in radio networks
• scientific article; zbMATH DE number 2079323 (Why is no real title available?)
• scientific article; zbMATH DE number 1559579 (Why is no real title available?)
• Plane gossip: approximating rumor spread in planar graphs
• Rumors across radio, wireless, telephone
• Sending secrets swiftly: approximation algorithms for generalized multicast problems

Cited in

(1)

• Product Multicommodity Flow in Wireless Networks

This page was built for publication: Multicommodity Multicast, Wireless and Fast

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