Approximation algorithm for directed telephone multicast problem

DOI10.1007/3-540-45061-0_19MaRDI QIDQ4449177zbMATH OpenFDO

Authors Michael Elkin, Guy Kortsarz

Publication date 8 February 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/2719/27190212.htm

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Recommendations

• An approximation algorithm for the directed telephone multicast problem
• Sublogarithmic approximation for telephone multicast
• A Combinatorial Logarithmic Approximation Algorithm for the Directed Telephone Broadcast Problem
• scientific article; zbMATH DE number 2079323
• Sending secrets swiftly: approximation algorithms for generalized multicast problems

Cited in

(8)

• A note on submodular set cover on matroids
• A note on line broadcast in digraphs under the edge-disjoint paths mode
• Approximation algorithms for minimum broadcast schedule problem in wireless sensor networks
• Sublogarithmic approximation for telephone multicast
• An approximation algorithm for the directed telephone multicast problem
• scientific article; zbMATH DE number 2079323 (Why is no real title available?)
• Source-limited inclusive routing: A new paradigm for multicast communication
• A Combinatorial Logarithmic Approximation Algorithm for the Directed Telephone Broadcast Problem

This page was built for publication: Approximation algorithm for directed telephone multicast problem

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