Sending secrets swiftly: approximation algorithms for generalized multicast problems

DOI10.1007/978-3-662-43951-7_48MaRDI QIDQ5167870zbMATH OpenOpenAlexFDO

Authors Afshin Nikzad, R. Ravi

Publication date 1 July 2014

Published in Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-43951-7_48

zbMATH Keywords

\(b\)-matchingapproximation algorithmsgraph algorithmsLP rounding

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Network design and communication in computer systems (68M10) Approximation algorithms (68W25) Communication networks in operations research (90B18)

Recommendations

• scientific article; zbMATH DE number 2079323
• A Combinatorial Logarithmic Approximation Algorithm for the Directed Telephone Broadcast Problem
• Sublogarithmic approximation for telephone multicast
• Plane gossip: approximating rumor spread in planar graphs
• An approximation algorithm for the directed telephone multicast problem

Cited in

(14)

• Plane gossip: approximating rumor spread in planar graphs
• Sublogarithmic approximation for telephone multicast
• scientific article; zbMATH DE number 2038712 (Why is no real title available?)
• scientific article; zbMATH DE number 2079323 (Why is no real title available?)
• Multicommodity Multicast, Wireless and Fast
• scientific article; zbMATH DE number 7077336 (Why is no real title available?)
• Rumors across radio, wireless, telephone
• Spreading Alerts Quietly and the Subgroup Escape Problem
• A Combinatorial Logarithmic Approximation Algorithm for the Directed Telephone Broadcast Problem
• Toward a general theory of unicast-based multicast communication
• The telephone k-multicast problem
• The telephone \(k\)-multicast problem
• Vector clock optimization via latency lengths
• Spreading alerts quietly and the subgroup escape problem

This page was built for publication: Sending secrets swiftly: approximation algorithms for generalized multicast problems

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