A new polynomial-time algorithm for linear programming
Combinatorica
Randomized rounding: a technique for provably good algorithms and algorithmic proofs
Combinatorica - Theory of Computing
Probabilistic construction of deterministic algorithms: approximating packing integer programs
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
Approximation algorithms for scheduling unrelated parallel machines
Mathematical Programming: Series A and B
Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2
Information Processing Letters
Designing broadcasting algorithms in the Postal Model for message-passing systems
Proceedings of the 4th ACM symposium on Parallel algorithms and architectures
Fast approximation algorithms for fractional packing and covering problems
Mathematics of Operations Research
Randomized algorithms
Approximation Algorithms for Minimum-Time Broadcast
SIAM Journal on Discrete Mathematics
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
Bicriteria network design problems
Journal of Algorithms
Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Sublogarithmic approximation for telephone multicast: path out of jungle (extended abstract)
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Rapid rumor ramification: approximating the minimum broadcast time
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
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
Minimum multicast time problem in wireless sensor networks
WASA'06 Proceedings of the First international conference on Wireless Algorithms, Systems, and Applications
| Hi-index | 0.00 |
Consider a network of processors modeled by an n-vertex directed 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 him 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. The processors of V\T may be left uninformed. The telephone multicast is a basic primitive in distributed computing and computer communication theory. In this paper we devise an algorithm that constructs a schedule with O(max{log k, log n/log k} ċ br* + k1/2)rounds for the directed k-multicast problem, where br* is the value of the optimum solution. This significantly improves the previously best-known approximation ratio of O(k1/3 ċ log n ċ br* + k2/3) due to [EK03]. We show that our algorithm for the directed multicast problem can be used to derive an algorithm with a similar ratio for the directed minimum poise Steiner arborescence problem, that is, the problem of constructing an arborescence that spans a collection T of terminals, minimizing the sum of height of the arborescence plus maximum out-degree in the arborescence.