The freeze-tag problem: How to wake up a swarm of robots

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 06-08-January-2002, Issue , 2002, Pages 568-577

  Arkin, Esther M ^a   Bender, Michael A ^b   Fekete, Sándor P ^c   Mitchell, Joseph S B ^a   Skutella, Martin ^d  

^a STONY BROOK UNIVERSITY   (United States)

^b Stony Brook University   (United States)

^c TECHNICAL UNIVERSITY OF BRAUNSCHWEIG   (Germany)

^d TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; COMBINATORIAL OPTIMIZATION; GRAPHIC METHODS; POLYNOMIAL APPROXIMATION; ROBOTS; WAKES;

APPROXIMATION FACTOR; EUCLIDEAN DISTANCE; FREEZE-TAG PROBLEMS; HARDNESS OF APPROXIMATION; ON-LINE ALGORITHMS; OPTIMIZATION PROBLEMS; POLYNOMIAL TIME APPROXIMATION ALGORITHMS; WORST-CASE PERFORMANCE;

OPTIMIZATION;

EID: 84968918943     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (9)

1. A. Bar-Noy, S. Guha, J. Naor, and B. Schieber. Multicasting in heterogeneous networks. In Proc. 30th Annual ACM Symposium on Theory of Computing, pages 448-453, 1998.
2. Y. Bartal. On approximating arbitrary metrics by tree metrics. In Proc. 30th Annual ACM Symposium on Theory of Computing, pages 161-168, 1998.
3. M. Charikar, C. Chekuri, A. Goel, S. Guha, and S. Plotkin. Approximating a finite metric by a small number of tree metrics. In Proc. 39th Annual IEEE Symposium on Foundations of Computer Science, pages 379-388, 1998.
4. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York, NY, 1979.
5. S. M. Hedetniemi, T. Hedetniemi, and A. L. Liestman. A Survey of Gossiping and Broadcasting in Communication Networks. Networks, 18:319-349, 1988.
6. D. S. Hochbaum and D. B. Shmoys. Using dual approximation algorithms for scheduling problems: Theoretical and practical results. J. ACM, 34:144-162, 1987.
7. G. Konjevod, R. Ravi, and F. Salman. On approximating planar metrics by tree metrics, Manuscript (submitted) 1997.
8. R. Ravi. Rapid rumor ramification: Approximating the minimum broadcast time. In Proc. 35th Annual IEEE Symposium on Foundations of Computer Science, pages 202-213, 1994.
9. R. E. Tarjan. Data Structures and Network Algorithms, volume 44 of CBMS-NSF Regional Conference Series in Applied Mathematics, SIAM, 1983.