{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,21]],"date-time":"2026-09-21T10:55:15Z","timestamp":1789988115653,"version":"4.0.1"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,9,3]],"date-time":"2015-09-03T00:00:00Z","timestamp":1441238400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada (CA)","doi-asserted-by":"publisher","award":["8136-2013"],"award-info":[{"award-number":["8136-2013"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2016,2]]},"DOI":"10.1007\/s00446-015-0253-8","type":"journal-article","created":{"date-parts":[[2015,9,2]],"date-time":"2015-09-02T08:16:18Z","timestamp":1441181778000},"page":"51-64","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Time versus cost tradeoffs for deterministic rendezvous in networks"],"prefix":"10.1007","volume":"29","author":[{"given":"Avery","family":"Miller","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrzej","family":"Pelc","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,9,3]]},"reference":[{"key":"253_CR1","doi-asserted-by":"crossref","first-page":"1164","DOI":"10.1137\/S009753979732428X","volume":"29","author":"S Albers","year":"2000","unstructured":"Albers, S., Henzinger, M.R.: Exploring unknown environments. SIAM J. Comput. 29, 1164\u20131188 (2000)","journal-title":"SIAM J. Comput."},{"key":"253_CR2","doi-asserted-by":"crossref","unstructured":"Aleliunas, R., Karp, R.M., Lipton, R.J., Lovasz, L., Rackoff, C.: Random walks, universal traversal sequences, and the complexity of maze problems. In: Proceedings of the 20th Annual Symposium on Foundations of Computer Science (FOCS 1979), pp. 218\u2013223","DOI":"10.1109\/SFCS.1979.34"},{"key":"253_CR3","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1137\/S0363012993249195","volume":"33","author":"S Alpern","year":"1995","unstructured":"Alpern, S.: The rendezvous search problem. SIAM J. Control Optim. 33, 673\u2013683 (1995)","journal-title":"SIAM J. Control Optim."},{"key":"253_CR4","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1002\/nav.10011","volume":"49","author":"S Alpern","year":"2002","unstructured":"Alpern, S.: Rendezvous search on labelled networks. Nav. Res. Logist. 49, 256\u2013274 (2002)","journal-title":"Nav. Res. Logist."},{"key":"253_CR5","volume-title":"The Theory of Search Games and Rendezvous.International Series in Operations research and Management Science","author":"S Alpern","year":"2002","unstructured":"Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous.International Series in Operations research and Management Science. Kluwer, Dordrecht (2002)"},{"key":"253_CR6","doi-asserted-by":"crossref","unstructured":"Ambuehl, C., Gasieniec, L., Pelc, A., Radzik, T., Zhang, X.: Tree exploration with logarithmic memory. ACM Trans. Algorithms 7(2), 17:1\u201317:21 (2011)","DOI":"10.1145\/1921659.1921663"},{"key":"253_CR7","doi-asserted-by":"crossref","first-page":"839","DOI":"10.2307\/3214827","volume":"28","author":"E Anderson","year":"1990","unstructured":"Anderson, E., Weber, R.: The rendezvous problem on discrete locations. J. Appl. Probab. 28, 839\u2013851 (1990)","journal-title":"J. Appl. Probab."},{"key":"253_CR8","doi-asserted-by":"crossref","unstructured":"Anderson, E., Fekete, S.: Asymmetric rendezvous on the plane. In: Proceedings of the 14th Annual ACM Symposium on Computational Geometry, pp. 365\u2013373 (1998)","DOI":"10.1145\/276884.276925"},{"key":"253_CR9","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1287\/opre.49.1.107.11191","volume":"49","author":"E Anderson","year":"2001","unstructured":"Anderson, E., Fekete, S.: Two-dimensional rendezvous search. Oper. Res. 49, 107\u2013118 (2001)","journal-title":"Oper. Res."},{"key":"253_CR10","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0166-218X(95)00054-U","volume":"68","author":"I Averbakh","year":"1996","unstructured":"Averbakh, I., Berman, O.: A heuristic with worst-case analysis for minimax routing of two traveling salesmen on a tree. Discret. Appl. Math. 68, 17\u201332 (1996)","journal-title":"Discret. Appl. Math."},{"key":"253_CR11","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/S0166-218X(97)89161-5","volume":"75","author":"I Averbakh","year":"1997","unstructured":"Averbakh, I., Berman, O.: $$(p-1)\/(p+1)$$ ( p - 1 ) \/ ( p + 1 ) -approximate algorithms for $$p$$ p -traveling salesmen problems on a tree with minmax objective. Discret. Appl. Math. 75, 201\u2013216 (1997)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"253_CR12","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1006\/inco.1999.2795","volume":"152","author":"B Awerbuch","year":"1999","unstructured":"Awerbuch, B., Betke, M., Rivest, R., Singh, M.: Piecemeal graph exploration by a mobile robot. Inf. Comput. 152(2), 155\u2013172 (1999)","journal-title":"Inf. Comput."},{"key":"253_CR13","doi-asserted-by":"crossref","unstructured":"Bampas, E., Czyzowicz, J., Gasieniec, L., Ilcinkas, D., Labourel, A.: Almost optimal asynchronous rendezvous in infinite multidimensional grids. In: Proceedings of the 24th International Symposium on Distributed Computing (DISC 2010), pp. 297\u2013311","DOI":"10.1007\/978-3-642-15763-9_28"},{"key":"253_CR14","doi-asserted-by":"crossref","first-page":"1880","DOI":"10.1137\/S0363012996314130","volume":"36","author":"V Baston","year":"1998","unstructured":"Baston, V., Gal, S.: Rendezvous on the line when the players\u2019 initial distance is given by an unknown probability distribution. SIAM J. Control Optim. 36, 1880\u20131889 (1998)","journal-title":"SIAM J. Control Optim."},{"key":"253_CR15","doi-asserted-by":"crossref","first-page":"722","DOI":"10.1002\/nav.1044","volume":"48","author":"V Baston","year":"2001","unstructured":"Baston, V., Gal, S.: Rendezvous search when marks are left at the starting points. Nav. Res. Logist. 48, 722\u2013731 (2001)","journal-title":"Nav. Res. Logist."},{"issue":"1","key":"253_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.2001.3081","volume":"176","author":"MA Bender","year":"2002","unstructured":"Bender, M.A., Fernandez, A., Ron, D., Sahai, A., Vadhan, S.: The power of a pebble: exploring and mapping directed graphs. Inf. Comput. 176(1), 1\u201321 (2002)","journal-title":"Inf. Comput."},{"key":"253_CR17","doi-asserted-by":"crossref","unstructured":"Bender, M.A., Slonim, D.: The power of team exploration: two robots can learn unlabeled directed graphs. In: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (FOCS 1994), pp. 75\u201385","DOI":"10.1109\/SFCS.1994.365703"},{"key":"253_CR18","first-page":"231","volume":"18","author":"M Betke","year":"1995","unstructured":"Betke, M., Rivest, R., Singh, M.: Piecemeal learning of an unknown environment. Mach. Learn. 18, 231\u2013254 (1995)","journal-title":"Mach. Learn."},{"key":"253_CR19","doi-asserted-by":"crossref","unstructured":"Chalopin, J., Das, S., Kosowski, A.: Constructing a map of an anonymous graph: applications of universal sequences. In: Proceedings of the 14th International Conference on Principles of Distributed Systems (OPODIS 2010), pp. 119\u2013134","DOI":"10.1007\/978-3-642-17653-1_10"},{"key":"253_CR20","doi-asserted-by":"crossref","first-page":"829","DOI":"10.1137\/100796534","volume":"41","author":"M Cieliebak","year":"2012","unstructured":"Cieliebak, M., Flocchini, P., Prencipe, G., Santoro, N.: Distributed computing by mobile robots: gathering. SIAM J. Comput. 41, 829\u2013879 (2012)","journal-title":"SIAM J. Comput."},{"key":"253_CR21","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s00446-011-0141-9","volume":"25","author":"J Czyzowicz","year":"2012","unstructured":"Czyzowicz, J., Kosowski, A., Pelc, A.: How to meet when you forget: log-space rendezvous in arbitrary graphs. Distrib. Comput. 25, 165\u2013178 (2012)","journal-title":"Distrib. Comput."},{"key":"253_CR22","doi-asserted-by":"crossref","unstructured":"Czyzowicz, J., Labourel, A., Pelc, A.: How to meet asynchronously (almost) everywhere. ACM Trans. Algorithms 8(4), 37:1\u201337:14 (2012)","DOI":"10.1145\/2344422.2344427"},{"key":"253_CR23","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1002\/(SICI)1097-0118(199911)32:3<265::AID-JGT6>3.0.CO;2-8","volume":"32","author":"X Deng","year":"1999","unstructured":"Deng, X., Papadimitriou, C.H.: Exploring an unknown graph. J. Graph Theory 32, 265\u2013297 (1999)","journal-title":"J. Graph Theory"},{"key":"253_CR24","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/j.tcs.2005.12.016","volume":"355","author":"G Marco De","year":"2006","unstructured":"De Marco, G., Gargano, L., Kranakis, E., Krizanc, D., Pelc, A., Vaccaro, U.: Asynchronous deterministic rendezvous in graphs. Theor. Comput. Sci. 355, 315\u2013326 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"253_CR25","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/j.ic.2014.12.005","volume":"243","author":"D Dereniowski","year":"2015","unstructured":"Dereniowski, D., Disser, Y., Kosowski, A., Pajak, D., Uznanski, P.: Fast collaborative graph exploration. Inf. Comput. 243, 37\u201349 (2015)","journal-title":"Inf. Comput."},{"key":"253_CR26","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s00453-006-0074-2","volume":"46","author":"A Dessmark","year":"2006","unstructured":"Dessmark, A., Fraigniaud, P., Kowalski, D., Pelc, A.: Deterministic rendezvous in graphs. Algorithmica 46, 69\u201396 (2006)","journal-title":"Algorithmica"},{"key":"253_CR27","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/j.tcs.2004.07.031","volume":"326","author":"A Dessmark","year":"2004","unstructured":"Dessmark, A., Pelc, A.: Optimal graph exploration without good maps. Theor. Comput. Sci. 326, 343\u2013362 (2004)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"253_CR28","doi-asserted-by":"crossref","first-page":"10:1","DOI":"10.1145\/2594581","volume":"11","author":"Y Dieudonn\u00e9","year":"2014","unstructured":"Dieudonn\u00e9, Y., Pelc, A.: Deterministic network exploration by anonymous silent agents with local traffic reports. ACM Trans. Algorithms 11(2), 10:1\u201310:29 (2014)","journal-title":"ACM Trans. Algorithms"},{"issue":"3","key":"253_CR29","doi-asserted-by":"crossref","first-page":"844","DOI":"10.1137\/130931990","volume":"44","author":"Y Dieudonn\u00e9","year":"2015","unstructured":"Dieudonn\u00e9, Y., Pelc, A., Villain, V.: How to meet asynchronously at polynomial cost. SIAM J. Comput. 44(3), 844\u2013867 (2015)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"253_CR30","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1145\/1159892.1159897","volume":"2","author":"CA Duncan","year":"2006","unstructured":"Duncan, C.A., Kobourov, S.G., Kumar, V.S.A.: Optimal constrained graph exploration. ACM Trans. Algorithms 2(3), 380\u2013402 (2006)","journal-title":"ACM Trans. Algorithms"},{"key":"253_CR31","doi-asserted-by":"crossref","unstructured":"Fleischer, R., Trippen, G.: Exploring an unknown graph efficiently. In: Proceedings of the 13th European Symposium on Algorithms (ESA 2005), pp. 11\u201322","DOI":"10.1007\/11561071_4"},{"key":"253_CR32","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/j.tcs.2005.01.001","volume":"337","author":"P Flocchini","year":"2005","unstructured":"Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Gathering of asynchronous robots with limited visibility. Theor. Comput. Sci. 337, 147\u2013168 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"253_CR33","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1002\/net.20127","volume":"48","author":"P Fraigniaud","year":"2006","unstructured":"Fraigniaud, P., Gasieniec, L., Kowalski, D., Pelc, A.: Collective tree exploration. Networks 48, 166\u2013177 (2006)","journal-title":"Networks"},{"key":"253_CR34","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Pelc, A.: Delays induce an exponential memory gap for rendezvous in trees, ACM Trans. Algorithms 9(2), 17:1\u201317:24 (2013)","DOI":"10.1145\/2438645.2438649"},{"key":"253_CR35","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1137\/0207017","volume":"7","author":"GN Frederickson","year":"1978","unstructured":"Frederickson, G.N., Hecht, M.S., Kim, C.E.: Approximation algorithms for some routing problems. SIAM J. Comput. 7, 178\u2013193 (1978)","journal-title":"SIAM J. Comput."},{"key":"253_CR36","doi-asserted-by":"crossref","unstructured":"Israeli, A., Jalfon, M.: Token management schemes and random walks yield self stabilizing mutual exclusion. In: Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing (PODC 1990), pp. 119\u2013131","DOI":"10.1145\/93385.93409"},{"key":"253_CR37","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/j.tcs.2008.02.010","volume":"399","author":"D Kowalski","year":"2008","unstructured":"Kowalski, D., Malinowski, A.: How to meet in anonymous network. Theor. Comput. Sci. 399, 141\u2013156 (2008)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"253_CR38","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1145\/1978782.1978789","volume":"7","author":"E Kranakis","year":"2011","unstructured":"Kranakis, E., Krizanc, D., Morin, P.: Randomized rendezvous with limited memory. ACM Trans. Algorithms 7(3), 34 (2011)","journal-title":"ACM Trans. Algorithms"},{"key":"253_CR39","doi-asserted-by":"crossref","unstructured":"Kranakis, E., Krizanc, D., Santoro, N., Sawchuk, C.: Mobile agent rendezvous in a ring. In: Proceedings of the 23rd International Conference on Distributed Computing Systems (ICDCS 2003), pp. 592\u2013599","DOI":"10.1109\/ICDCS.2003.1203510"},{"key":"253_CR40","doi-asserted-by":"crossref","first-page":"1650","DOI":"10.1137\/S036301299427816X","volume":"34","author":"W Lim","year":"1996","unstructured":"Lim, W., Alpern, S.: Minimax rendezvous on the line. SIAM J. Control Optim. 34, 1650\u20131665 (1996)","journal-title":"SIAM J. Control Optim."},{"key":"253_CR41","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1006\/jagm.1999.1043","volume":"33","author":"P Panaite","year":"1999","unstructured":"Panaite, P., Pelc, A.: Exploring unknown undirected graphs. J. Algorithms 33, 281\u2013295 (1999)","journal-title":"J. Algorithms"},{"key":"253_CR42","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1002\/net.21453","volume":"59","author":"A Pelc","year":"2012","unstructured":"Pelc, A.: Deterministic rendezvous in networks: a comprehensive survey. Networks 59, 331\u2013347 (2012)","journal-title":"Networks"},{"key":"253_CR43","first-page":"39","volume":"7","author":"L Redei","year":"1934","unstructured":"Redei, L.: Ein kombinatorischer Satz. Acta Litt. Szeged 7, 39\u201343 (1934)","journal-title":"Acta Litt. Szeged"},{"key":"253_CR44","doi-asserted-by":"crossref","unstructured":"Reingold, O.: Undirected connectivity in log-space. J. ACM 55(4), 17:1\u201317:24 (2008)","DOI":"10.1145\/1391289.1391291"},{"issue":"3","key":"253_CR45","doi-asserted-by":"crossref","first-page":"12:1","DOI":"10.1145\/2601068","volume":"10","author":"A Ta-Shma","year":"2014","unstructured":"Ta-Shma, A., Zwick, U.: Deterministic rendezvous, treasure hunts, and strongly universal exploration sequences. ACM Trans. Algorithms 10(3), 12:1\u201312:15 (2014)","journal-title":"ACM Trans. Algorithms"},{"key":"253_CR46","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1057\/jors.1992.89","volume":"43","author":"L Thomas","year":"1992","unstructured":"Thomas, L.: Finding your kids when they are lost. J. Oper. Res. Soc. 43, 637\u2013639 (1992)","journal-title":"J. Oper. Res. Soc."}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-015-0253-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-015-0253-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-015-0253-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,29]],"date-time":"2019-08-29T23:02:24Z","timestamp":1567119744000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-015-0253-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,3]]},"references-count":46,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,2]]}},"alternative-id":["253"],"URL":"https:\/\/doi.org\/10.1007\/s00446-015-0253-8","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,9,3]]}}}