Randomized rounding: a technique for provably good algorithms and algorithmic proofs
Combinatorica - Theory of Computing
Approximation algorithms for scheduling unrelated parallel machines
Mathematical Programming: Series A and B
Approximation Algorithms for Minimum-Time Broadcast
SIAM Journal on Discrete Mathematics
Approximation algorithms for NP-hard problems
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Multicasting in heterogeneous networks
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
A note on line broadcast in digraphs under the edge-disjoint paths mode
Discrete Applied Mathematics - Fun with algorithms 2 (FUN 2001)
Efficient trigger-broadcasting in heterogeneous clusters
Journal of Parallel and Distributed Computing
Broadcasting on networks of workstations
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
An efficient heuristic for broadcasting in networks
Journal of Parallel and Distributed Computing
On the number of broadcast schemes in networks
Information Processing Letters
Approximation and heuristic algorithms for minimum-delay application-layer multicast trees
IEEE/ACM Transactions on Networking (TON)
Efficient heuristics for message dissemination in networks
PDCN'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: parallel and distributed computing and networks
Trade-offs between the size of advice and broadcasting time in trees
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Broadcasting in necklace graphs
C3S2E '09 Proceedings of the 2nd Canadian Conference on Computer Science and Software Engineering
Optimum Broadcasting in Complete Weighted-Vertex Graphs
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Approximation algorithm for directed telephone multicast problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Minimum multicast time problem in wireless sensor networks
WASA'06 Proceedings of the First international conference on Wireless Algorithms, Systems, and Applications
The worst case behavior of randomized gossip
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Linear algorithm for broadcasting in unicyclic graphs
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Hi-index | 0.00 |
Consider a network of processors modeled by an n-vertex graph G = (V, E). Assume that the communication in the network is synchronous, i.e., occurs in discrete "rounds", and in every round every processor is allowed to pick one of its neighbors, and to send it a message. The telephone k-multicast problem requires to compute a schedule with minimal number of rounds that delivers a message from a given single processor, that generates the message, to all the processors of a given set T ⊆ V, |T| = k, whereas the processors of V \ T may be left uninformed. The case T = V is called broadcast problem.The telephone multicast and broadcast are basic primitives in distributed computing and computer communication theory. Several approximation algorithms with a polylogarithmic ratio were suggested for these problems, and the upper bound on their approximation threshold stands currently on O(log k) and O(log n), respectively.In this paper we devise an O(log k/log log k)-approximation algorithm for the k-multicast problem, and, consequently, an O(log n/log log n)-approximation algorithm for the broadcast problem. Even stronger than that, whenever an instance of the k-multicast problem admits a schedule of length br*, our algorithm guarantees an approximation ratio of O(log k/log br*). As br* is always at least log k, the ratio of O(log k/log log k) follows. In addition, whenever br* = Ω(kδ) for some constant δ constant O(1/δ)-approximation ratio for the problem.Regarding the techniques, some previous papers on the subject used the idea of covering the set T of terminals by a forest, and broadcasting the message through this forest. In the current paper we develop a novel technique of covering the set of terminals by a jungle, that is, a collection of trees that are even not necessarily edge-disjoint, which nevertheless possess some other useful properties. The usage of jungles enables to obtain much smaller collections of trees, and this is reflected in the improved approximation ratio.We also derive results regarding the directed and edged-ependent heterogenous k-multicast problems.