Analysis of heuristics for the freeze-tag problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2368, Issue , 2002, Pages 270-279

  Sztainberg, Marcelo O ^a   Arkin, Esther M ^a   Bender, Michael A ^a   Mitchell, Joseph S B ^a  

^a Stony Brook University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ANALYSIS OF HEURISTICS; APPROXIMATION BOUNDS; APPROXIMATION FACTOR; FREEZE-TAG PROBLEMS; GENERAL METRIC SPACES; GREEDY STRATEGIES; HEURISTIC STRATEGY; PERFORMANCE BOUNDS;

ROBOTS;

EID: 84943245562     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45471-3_28     Document Type: Conference Paper

References (7)

1. E. M. Arkin, M. A. Bender, S. P. Fekete, J. S. B. Mitchell, and M. Skutella. The freeze-tag problem: How to wake up a swarm of robots. In Proc. 13th ACM-SIAM Sympos. Discrete Algorithms, pp. 568–577, 2002.
2. A. Bar-Noy, S. Guha, J. Naor, and B. Schieber. Multicasting in heterogeneous networks. In Proc. 30th ACM Sympos. Theory of Comput., pp. 448–453, 1998.
3. S. N. Bespamyatnikh. Dynamic algorithms for approximate neighbor searching. In Proc. 8th Canad. Conf. Comput. Geom., pp. 252–257, 1996.
4. S. M. Hedetniemi, T. Hedetniemi, and A. L. Liestman. A Survey of Gossiping and Broadcasting in Communication Networks. NETWORKS, 18:319–349, 1988.
5. S. Kapoor and M. Smid. New techniques for exact and approximate dynamic closestpoint problems. SIAM J. Comput., 25:775–796, 1996.
6. R. Ravi. Rapid rumor ramification: Approximating the minimum broadcast time. Proc. 35th Ann. Sympos. on Foundations of Computer Sci., pp. 202–213, 1994.
7. http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/.