Deterministic Rendezvous in Graphs

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

Volumn 2832, Issue , 2003, Pages 184-195

  Dessmark, Anders ^a   Fraigniaud, Pierre ^b   Pelc, Andrzej ^c  

^a LUND UNIVERSITY   (Sweden)

^b CNRS   (France)

^c UNIVERSITÉ DU QUÉBEC EN OUTAOUAIS   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; MOBILE AGENTS;

CONNECTED GRAPH; DETERMINISTIC ALGORITHMS; RENDEZVOUS PROBLEMS;

GRAPH THEORY;

EID: 0142183805     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39658-1_19     Document Type: Article

References (17)

1. S. Alpern. The rendezvous search problem. SIAM J. on Control and Optimization 33(3), pp. 673-683, 1995.
2. S. Alpern. Rendezvous search on labelled networks. Naval Reaserch Logistics 49, pp. 256-274, 2002.
3. S. Alpern and S. Gal. The theory of search games and rendezvous. Int. Series in Operations research and Management Science, number 55, Kluwer Academic Publishers, 2002.
4. J. Alpern, V. Baston, and S. Essegaier. Rendezvous search on a graph. Journal of Applied Probability 36(1), pp. 223-231, 1999.
5. S. Alpern and S. Gal. Rendezvous search on the line with distinguishable players. SIAM J. on Control and Optimization 33, pp. 1270-1276, 1995.
6. E. Anderson and R. Weber. The rendezvous problem on discrete locations. Journal of Applied Probability 28, pp. 839-851, 1990.
7. E. Anderson and S. Essegaier. Rendezvous search on the line with indistinguishable players. SIAM J. on Control and Optimization 33, pp. 1637-1642, 1995.
8. E. Anderson and S. Fekete. Asymmetric rendezvous on the plane. Proc. 14th Annual ACM Symp. on Computational Geometry, 1998.
9. E. Anderson and S. Fekete. Two-dimensional rendezvous search. Operations Research 49, pp. 107-118, 2001.
10. V. Baston and S. Gal. Rendezvous on the line when the players' initial distance is given by an unknown probability distribution. SIAM J. on Control and Optimization 36, pp. 1880-1889, 1998.
11. V. Baston and S. Gal. Rendezvous search when marks are left at the starting points. Naval Res. Log. 48, pp. 722-731, 2001.
12. P. Flocchini, G. Prencipe, N. Santoro, P. Widmayer, Gathering of asynchronous oblivious robots with limited visibility, Proc. 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2001), LNCS 2010, pp. 247-258, 2001.
13. S. Gal. Rendezvous search on the line. Operations Research 47, pp. 974-976, 1999.
14. J. Howard. Rendezvous search on the interval and circle. Operation research 47(4), pp. 550-558, 1999.
15. W. Lim and S. Alpern. Minimax rendezvous on the line. SIAM J. on Control and Optimization 34(5), pp. 1650-1665, 1996.
16. T. Schelling. The strategy of conflict. Oxford University Press, Oxford, 1960.
17. L. Thomas. Finding your kids when they are lost. Journal on Operational Res. Soc. 43, pp. 637-639, 1992.