Journal of Algorithms
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
Approximation Algorithms for Minimum-Time Broadcast
SIAM Journal on Discrete Mathematics
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
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
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
Broadcasting and Multicasting in Cut-through Routed Networks
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Toward a General Theory of Unicast-Based Multicast Communication
WG '95 Proceedings of the 21st International Workshop on Graph-Theoretic Concepts in Computer Science
Approximation algorithm for directed telephone multicast problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
A taxonomy of multicast protocols for Internet applications
Computer Communications
New models and algorithms for future networks
IEEE Transactions on Information Theory
Multipoint communication: a survey of protocols, functions, and mechanisms
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
It is known that unless NP ⊂ DTIME(nlog log n), no polynomial-time approximation algorithm for the multicast problem can have approximation ratio less than Ω(log n) in n-node digraphs under the edge-disjoint paths mode of the line model. In this note, we give a polynomial-time O((Δmin + log n)/(log(Δmin + log n)))-approximation algorithm, where (Δmin is the smallest integer k such that there exists a rooted directed tree of maximum out-degree k, spanning the considered digraph.