乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:17:07Z","timestamp":1725560227089},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540200642"},{"type":"electronic","value":"9783540396581"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39658-1_19","type":"book-chapter","created":{"date-parts":[[2010,7,22]],"date-time":"2010-07-22T19:24:30Z","timestamp":1279826670000},"page":"184-195","source":"Crossref","is-referenced-by-count":34,"title":["Deterministic Rendezvous in Graphs"],"prefix":"10.1007","author":[{"given":"Anders","family":"Dessmark","sequence":"first","affiliation":[]},{"given":"Pierre","family":"Fraigniaud","sequence":"additional","affiliation":[]},{"given":"Andrzej","family":"Pelc","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"19_CR1","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1137\/S0363012993249195","volume":"33","author":"S. Alpern","year":"1995","unstructured":"Alpern, S.: The rendezvous search problem. SIAM J. on Control and Optimization\u00a033(3), 673\u2013683 (1995)","journal-title":"SIAM J. on Control and Optimization"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1002\/nav.10011","volume":"49","author":"S. Alpern","year":"2002","unstructured":"Alpern, S.: Rendezvous search on labelled networks. Naval Reaserch Logistics\u00a049, 256\u2013274 (2002)","journal-title":"Naval Reaserch Logistics"},{"key":"19_CR3","series-title":"Int. Series in Operations research and Management Science","volume-title":"The theory of search games and rendezvous","author":"S. Alpern","year":"2002","unstructured":"Alpern, S., Gal, S.: The theory of search games and rendezvous. Int. Series in Operations research and Management Science, vol.\u00a055. Kluwer Academic Publishers, Dordrecht (2002)"},{"issue":"1","key":"19_CR4","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1239\/jap\/1032374243","volume":"36","author":"J. Alpern","year":"1999","unstructured":"Alpern, J., Baston, V., Essegaier, S.: Rendezvous search on a graph. Journal of Applied Probability\u00a036(1), 223\u2013231 (1999)","journal-title":"Journal of Applied Probability"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"1270","DOI":"10.1137\/S0363012993260288","volume":"33","author":"S. Alpern","year":"1995","unstructured":"Alpern, S., Gal, S.: Rendezvous search on the line with distinguishable players. SIAM J. on Control and Optimization\u00a033, 1270\u20131276 (1995)","journal-title":"SIAM J. on Control and Optimization"},{"key":"19_CR6","doi-asserted-by":"publisher","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. Journal of Applied Probability\u00a028, 839\u2013851 (1990)","journal-title":"Journal of Applied Probability"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"1637","DOI":"10.1137\/S0363012993260707","volume":"33","author":"E. Anderson","year":"1995","unstructured":"Anderson, E., Essegaier, S.: Rendezvous search on the line with indistinguishable players. SIAM J. on Control and Optimization\u00a033, 1637\u20131642 (1995)","journal-title":"SIAM J. on Control and Optimization"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Anderson, E., Fekete, S.: Asymmetric rendezvous on the plane. In: Proc. 14th Annual ACM Symp. on Computational Geometry (1998)","DOI":"10.1145\/276884.276925"},{"key":"19_CR9","doi-asserted-by":"publisher","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. Operations Research\u00a049, 107\u2013118 (2001)","journal-title":"Operations Research"},{"key":"19_CR10","doi-asserted-by":"publisher","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. on Control and Optimization\u00a036, 1880\u20131889 (1998)","journal-title":"SIAM J. on Control and Optimization"},{"key":"19_CR11","doi-asserted-by":"publisher","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. Naval Res. Log.\u00a048, 722\u2013731 (2001)","journal-title":"Naval Res. Log."},{"key":"19_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/3-540-44693-1_22","volume-title":"STACS 2001","author":"P. Flocchini","year":"2001","unstructured":"Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Gathering of asynchronous oblivious robots with limited visibility. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol.\u00a02010, pp. 247\u2013258. Springer, Heidelberg (2001)"},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"974","DOI":"10.1287\/opre.47.6.974","volume":"47","author":"S. Gal","year":"1999","unstructured":"Gal, S.: Rendezvous search on the line. Operations Research\u00a047, 974\u2013976 (1999)","journal-title":"Operations Research"},{"issue":"4","key":"19_CR14","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1287\/opre.47.4.550","volume":"47","author":"J. Howard","year":"1999","unstructured":"Howard, J.: Rendezvous search on the interval and circle. Operation research\u00a047(4), 550\u2013558 (1999)","journal-title":"Operation research"},{"issue":"5","key":"19_CR15","doi-asserted-by":"publisher","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. on Control and Optimization\u00a034(5), 1650\u20131665 (1996)","journal-title":"SIAM J. on Control and Optimization"},{"volume-title":"The strategy of conflict","year":"1960","author":"T. Schelling","key":"19_CR16","unstructured":"Schelling, T.: The strategy of conflict. Oxford University Press, Oxford (1960)"},{"key":"19_CR17","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. Journal on Operational Res. Soc.\u00a043, 637\u2013639 (1992)","journal-title":"Journal on Operational Res. Soc."}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39658-1_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T03:06:31Z","timestamp":1552791991000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39658-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540200642","9783540396581"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39658-1_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}