Author:
Sztainberg Marcelo O.,Arkin Esther M.,Bender Michael A.,Mitchell Joseph S. B.
Publisher
Springer Berlin Heidelberg
Reference7 articles.
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 closest-point problems. SIAM J. Comput., 25:775–796, 1996.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Cooperative TSP;Theoretical Computer Science;2010-06
2. The Online Freeze-Tag Problem;LATIN 2006: Theoretical Informatics;2006
3. Cooperative TSP;Lecture Notes in Computer Science;2006
4. Distributed Coordination Algorithms for Mobile Robot Swarms: New Directions and Challenges;Distributed Computing – IWDC 2005;2005