{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:39:47Z","timestamp":1725489587760},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540656913"},{"type":"electronic","value":"9783540491163"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-49116-3_10","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T08:56:14Z","timestamp":1187254574000},"page":"110-120","source":"Crossref","is-referenced-by-count":9,"title":["An Optimal Competitive Strategy for Walking in Streets"],"prefix":"10.1007","author":[{"given":"Christian","family":"Icking","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Klein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elmar","family":"Langetepe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,4,12]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"D. Angluin, J. Westbrook, and W. Zhu. Robot navigation with range queries. In Proc. 28th Annu. ACM Sympos. Theory Comput., pages 469\u2013478, May 1996.","DOI":"10.1145\/237814.237995"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1006\/inco.1993.1054","volume":"106","author":"R. Baeza-Yates","year":"1993","unstructured":"R. Baeza-Yates, J. Culberson, and G. Rawlins. Searching in the plane. Inform. Comput., 106:234\u2013252, 1993.","journal-title":"Inform. Comput."},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"P. Berman. On-line searching and navigation. In A. Fiat and G. Woeginger, editors, Competitive Analysis of Algorithms. Springer-Verlag, 1998.","DOI":"10.1007\/BFb0029571"},{"issue":"1","key":"10_CR4","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1137\/S0097539791194931","volume":"26","author":"A. Blum","year":"1997","unstructured":"A. Blum, P. Raghavan, and B. Schieber. Navigating in unfamiliar geometric terrain. SIAM J. Comput., 26(1):110\u2013137, Feb. 1997.","journal-title":"SIAM J. Comput."},{"key":"10_CR5","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0925-7721(95)00042-9","volume":"7","author":"G. Das","year":"1997","unstructured":"G. Das, P. Heffernan, and G. Narasimhan. LR-visibility in polygons. Comput. Geom. Theory Appl., 7:37\u201357, 1997.","journal-title":"Comput. Geom. Theory Appl."},{"key":"10_CR6","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/S0925-7721(97)00003-5","volume":"8","author":"S. K. Ghosh","year":"1997","unstructured":"S. K. Ghosh and S. Saluja. Optimal on-line algorithms for walking with minimum number of turns in unkn. streets. Comput. Geom. Theory Appl., 8:241\u2013266, 1997.","journal-title":"Comput. Geom. Theory Appl."},{"key":"10_CR7","series-title":"PhD thesis","volume-title":"Motion and Visibility in Simple Polygons","author":"C. Icking","year":"1994","unstructured":"C. Icking. Motion and Visibility in Simple Polygons. PhD thesis, FernUniversit\u00e4t Hagen, 1994."},{"key":"10_CR8","volume-title":"Technical Report 228","author":"C. Icking","year":"1998","unstructured":"C. Icking, A. L\u00f3pez-Ortiz, S. Schuierer, and I. Semrau. Going home through an unknown street. Technical Report 228, Dep. of Comp. Science, FernUniversit\u00e4t Hagen, 1998. http:\/\/wwwpi6.fernuni-hagen.de\/Publikationen\/tr228.pdf , submitted."},{"key":"10_CR9","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/0925-7721(92)90010-P","volume":"1","author":"R. Klein","year":"1992","unstructured":"R. Klein. Walking an unknown street with bounded detour. Comput. Geom. Theory Appl., 1:325\u2013351, 1992.","journal-title":"Comput. Geom. Theory Appl."},{"key":"10_CR10","unstructured":"J. M. Kleinberg. On-line search in a simple polygon. In Proc. 5th ACM-SIAM Sympos. Discrete Algorithms, pages 8\u201315, 1994."},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"A. L\u00f3pez-Ortiz and S. Schuierer. Going home through an unknown street. In Proc. 4th Workshop Algorithms Data Struct., volume 955 of Lecture Notes Comput. Sci., pages 135\u2013146. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-60220-8_57"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"A. L\u00f3pez-Ortiz and S. Schuierer. Walking streets faster. In Proc. 5th Scand. Workshop Algorithm Theory, volume 1097 of Lecture Notes Comput. Sci., pages 345\u2013356. Springer-Verlag, 1996.","DOI":"10.1007\/3-540-61422-2_144"},{"key":"10_CR13","volume-title":"Handbook of Computational Geometry","author":"J. S. B. Mitchell","year":"1998","unstructured":"J. S. B. Mitchell. Geometric shortest paths and network optimization. In J. R. Sack and J. Urrutia, editors, Handbook of Computational Geometry. Elsevier Science Publishers B.V. North-Holland, Amsterdam, 1998."},{"key":"10_CR14","unstructured":"N. S. V. Rao, S. Kareti, W. Shi, and S. S. Iyengar. Robot navigation in unknown terrains: introductory survey of non-heuristic algorithms. Technical Report ORNL\/TM-12410, Oak Ridge National Laboratory, 1993."},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"S. Schuierer and I. Semrau. An optimal strategy for searching in unknown streets. Institut f\u00fcr Informatik, Universit\u00e4t Freiburg, 1998.","DOI":"10.1007\/3-540-49116-3_11"},{"key":"10_CR16","volume-title":"Diploma thesis","author":"I. Semrau","year":"1996","unstructured":"I. Semrau. Analyse und experimentelle Untersuchung von Strategien zum Finden eines Ziels in Stra\u00dfenpolygonen. Diploma thesis, FernUniversit\u00e4t Hagen, 1996."},{"issue":"1","key":"10_CR17","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1142\/S0218195998000060","volume":"8","author":"L. H. Tseng","year":"1998","unstructured":"L. H. Tseng, P. Heffernan, and D. T. Lee. Two-guard walkability of simple polygons. Internat. J. Comput. Geom. Appl., 8(1):85\u2013116, 1998.","journal-title":"Internat. J. Comput. Geom. Appl."}],"container-title":["Lecture Notes in Computer Science","STACS 99"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49116-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T00:43:04Z","timestamp":1556757784000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49116-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540656913","9783540491163"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-49116-3_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}