Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem
From MaRDI portal
Publication:3579240
DOI10.1145/509907.509972zbMath1192.68891OpenAlexW2008755444MaRDI QIDQ3579240
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
Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Approximation algorithms (68W25)
Related Items (6)
Approximation algorithms in graphs with known broadcast time of the base graph ⋮ Combinatorial algorithms for distributed graph coloring ⋮ 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 ⋮ On broadcasting in unicyclic graphs
This page was built for publication: Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem
