Multiple Mobile Agent Rendezvous in a Ring

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

Volumn 2976, Issue , 2004, Pages 599-608

  Flocchini, Paola ^a   Kranakis, Evangelos ^b   Krizanc, Danny ^c   Santoro, Nicola ^b   Sawchuk, Cindy ^b  

^a UNIVERSITY OF OTTAWA   (Canada)

^b CARLETON UNIVERSITY   (Canada)

^c WESLEYAN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PROBLEM SOLVING;

DETERMINISTIC ALGORITHMS; LEADER ELECTION; LOWER BOUNDS; MULTIPLE MOBILE AGENTS; NODE RING; RANDOMIZED ALGORITHMS; RENDEZVOUS PROBLEMS; RENDEZVOUS SEARCH PROBLEMS;

MOBILE AGENTS;

EID: 33745614932     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24698-5_62     Document Type: Article

References (10)

1. S. Alpern, Rendezvous Search: A Personal Perspective, Operations Research, 50, No. 5, pp. 772-795, 2002.
2. S. Alpern and S. Gal, The Theory of Search Games and Rendezvous, Kluwer Academic Publishers, London, 2003.
3. L. Barriere, P. Flocchini, P. Praigniaud, and N. Santoro, Election and Rendezvous of Anonymous Mobile Agents in Anonymous Networks with Sense of Direction, Proceedings of the 9th International Colloquium on Structural Information and Communication Complexity (SIROCCO), pp. 17-32, 2003.
4. L. Barriere, P. Flocchini, P. Fraigniaud, and N. Santoro, Can We Elect If We Cannot Compare?, Proceedings of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 324-332, 2003.
5. V. Baston and S. Gal, Rendezvous Search When Marks are Left at the Starting Points, Naval Research Logistics, 47, No. 6, pp. 722-731, 2001.
6. S. Gal, Rendezvous Search on the Line, Operations Research, 47, No. 6, pp. 849-861, 1999.
7. E. Kranakis, D. Krizanc, N. Santoro, and C. Sawchuk, Mobile Agent Rendezvous in the Ring, International Conference on Distributed Computing Systems (ICDCS 2003), pp. 592-599, Providence, RI, May 19-22, 2003.
8. Rendezvous Search on the Line with More than Two Players, Operations Research, 45, pp. 357-364, 1997.
9. M. Pikounis and L.C. Thomas, Many Player Rendezvous Search: Stick Together or Split and Meet? University of Edinburgh, Management School, Preprint, 1998.
10. X. Yu and M. Yung, Agent Rendezvous: A Dynamic Symmtery-Breaking Problem, Proceedings of ICALP'96, LNCS 1099, pp. 610-621, 1996.