Approximation Algorithms for Minimum-Time Broadcast under the Vertex-Disjoint Paths Mode-Reference-Cited by-同舟云学术

Approximation Algorithms for Minimum-Time Broadcast under the Vertex-Disjoint Paths Mode

Published:2001 Issue: Volume: Page:440-451
ISSN:0302-9743
Container-title:Algorithms — ESA 2001
language:
Short-container-title:

Author:

Fraigniaud Pierre

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-44676-1_37

Reference29 articles.

1. A. Bar-Noy, S. Guha, J. Naor, and B. Schieber. Multicasting in heterogeneous networks. In 30th ACM Symposium on Theory of Computing (STOC’ 98), pages 448–453, 1998.

2. D. Barth and P. Fraigniaud. Approximation algorithms for structured communication problems. In 9th ACM Symposium on Parallel Algorithms and Architectures (SPAA’ 97),pages 180–188, 1997. (Tech. Rep. LRI-1239, Univ. Paris-Sud. http://www.lri.fr/~pierre ).

3. J.-C. Bermond, A. Bonnecaze, T. Kodate, S. Pérennes, and P. Sole. Broadcasting in hypercubes under the circuit-switched model. In IEEE Int. Parallel and Distributed Processing Symp. (IPDPS), 2000.

4. Lect Notes Comput Sci;J.-C. Bermond,1995

5. Lect Notes Comput Sci;B. Birchler,1995

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Parameterized Complexity of Broadcasting in Graphs;Graph-Theoretic Concepts in Computer Science;2023

2. Near-Linear Time Algorithm for Approximate Minimum Degree Spanning Trees;LATIN 2020: Theoretical Informatics;2020

3. On the complexity of the shortest-path broadcast problem;Discrete Applied Mathematics;2016-01

4. Lower Bounds on Data Collection Time in Sensor Networks;Wireless Algorithms, Systems, and Applications;2012

5. Efficient trigger-broadcasting in heterogeneous clusters;Journal of Parallel and Distributed Computing;2005-05