Sublogarithmic approximation for telephone multicast

DOI10.1016/J.JCSS.2005.12.002MaRDI QIDQ2495404zbMATH OpenOpenAlexFDO

Authors Michael Elkin, Guy Kortsarz

Publication date 30 June 2006

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jcss.2005.12.002

zbMATH Keywords

broadcastgraphssublogarithmicundirected

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25) Communication networks in operations research (90B18)

Recommendations

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

Cites work

• A survey of gossiping and broadcasting in communication networks
• Approximation Algorithms for Minimum-Time Broadcast
• Approximation algorithms for scheduling unrelated parallel machines
• Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem
• scientific article; zbMATH DE number 1875435 (Why is no real title available?)
• Many birds with one stone
• Message Multicasting in Heterogeneous Networks

Cited in

(28)

• A note on line broadcast in digraphs under the edge-disjoint paths mode
• The non-uniform bounded degree minimum diameter spanning tree problem with an application in P2P networking
• Radio aggregation scheduling
• Plane gossip: approximating rumor spread in planar graphs
• An approximation algorithm for the directed telephone multicast problem
• scientific article; zbMATH DE number 1688370 (Why is no real title available?)
• The topology aware file distribution problem
• 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
• Broadcasting on cactus graphs
• Sending secrets swiftly: approximation algorithms for generalized multicast problems
• A linear algorithm for finding the k‐broadcast center of a tree
• A Combinatorial Logarithmic Approximation Algorithm for the Directed Telephone Broadcast Problem
• Broadcasting in weighted trees under the postal model
• Parameterized Complexity of Broadcasting in Graphs
• A note to non-adaptive broadcasting
• Finding broadcast 2-centers of a tree under the postal model
• The telephone k-multicast problem
• Bounds on broadcast time in well-connected graphs
• The telephone \(k\)-multicast problem
• \textsc{Telephone Broadcast} on graphs of treewidth two
• Broadcast schemes of hypercubes
• Broadcasting under structural restrictions
• On the complexity of telephone broadcasting from cacti to bounded pathwidth graphs
• Approximating optimal broadcast of files in a hose-model network
• On the complexity of the shortest-path broadcast problem
• Broadcasting on networks of workstations

This page was built for publication: Sublogarithmic approximation for telephone multicast

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