Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem

DOI10.1145/509907.509972MaRDI QIDQ3579240zbMATH OpenOpenAlexFDO

Authors Michael Elkin, Guy Kortsarz

Publication date 5 August 2010

Published in Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/509907.509972

Mathematics Subject Classification ID

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

Cited in

(9)

• On broadcasting in unicyclic graphs
• A note on line broadcast in digraphs under the edge-disjoint paths mode
• Combinatorial algorithms for distributed graph coloring
• Approximation algorithms for minimum broadcast schedule problem in wireless sensor networks
• Sublogarithmic approximation for telephone multicast
• Approximation algorithms in graphs with known broadcast time of the base graph
• Broadcasting in stars of cliques
• Broadcast schemes of hypercubes
• Vector clock optimization via latency lengths

This page was built for publication: Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem

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