Approximating the minimum degree spanning tree to within one from the optimal degree
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Methods and problems of communication in usual networks
Proceedings of the international workshop on Broadcasting and gossiping 1990
Approximating the minimum-degree Steiner tree to within one of optimal
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
Maximum number of disjoint paths connecting specified terminals in a graph
Discrete Applied Mathematics
Approximation Algorithms for Minimum-Time Broadcast
SIAM Journal on Discrete Mathematics
Gossiping in vertex-disjoint paths mode in d-dimensional grids and planar graphs
Information and Computation
Circuit-Switched Broadcasting in Torus Networks
IEEE Transactions on Parallel and Distributed Systems
Optimal algorithms for broadcast and gossip in the edge-disjoint path modes
Information and Computation
Approximation algorithms for structured communication problems
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Multicasting in heterogeneous networks
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Broadcasting, multicasting and gossiping in trees under the all-port line model
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Discrete Applied Mathematics - Special issue: network communications broadcasting and gossiping
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Scheduling calls for multicasting in tree-networks
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Broadcasting and Multicasting in Cut-through Routed Networks
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Fast Gossiping by Short Messages
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
On the inapproximability of broadcasting time
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Toward a General Theory of Unicast-Based Multicast Communication
WG '95 Proceedings of the 21st International Workshop on Graph-Theoretic Concepts in Computer Science
Broadcasting in Hypercubes in the Circuit Switched Model
IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
Rapid rumor ramification: approximating the minimum broadcast time
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
A taxonomy of multicast protocols for Internet applications
Computer Communications
Multipoint communication: a survey of protocols, functions, and mechanisms
IEEE Journal on Selected Areas in Communications
Efficient trigger-broadcasting in heterogeneous clusters
Journal of Parallel and Distributed Computing
Sublogarithmic approximation for telephone multicast
Journal of Computer and System Sciences
The minimum degree spanning tree problem on directed acyclic graphs
ACS'06 Proceedings of the 6th WSEAS international conference on Applied computer science
| Hi-index | 0.00 |
We give a polynomial-time O(log n/log OPT)-approximation algorithm for minimum-time broadcast and minimum-time multicast in n-node networks under the single-port vertex-disjoint paths mode. This improves a previous approximation algorithm by Kortsarz and Peleg. In contrast, we give an Ω(log n) lower bound for the approximation ratio of the minimum-time multicast problem in directed networks. This lower bound holds unless NP ⊂ DTIME(nlog log n). An important consequence of this latter result is that the Steiner version of the Minimum Degree Spanning Tree (MDST) problem in digraphs cannot be approximated within a constant ratio, as opposed to the undirected version. Finally, we give a polynomial-time O(1)-approximation algorithm for minimum-time gossip (i.e., all-to-all broadcast).