{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:08:06Z","timestamp":1725455286278},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540605737"},{"type":"electronic","value":"9783540477662"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/bfb0015406","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T06:50:06Z","timestamp":1131864606000},"page":"32-41","source":"Crossref","is-referenced-by-count":16,"title":["Competitive searching in polygons\u2014Beyond generalised streets"],"prefix":"10.1007","author":[{"given":"Amitava","family":"Datta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christoph A.","family":"Hipke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sven","family":"Schuierer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"A. Blum and P. Chalasani. \u201cAn on-line algorithm for improving performance in navigation\u201d Proc. of 34th Annual IEEE Conference on Foundations of Computer Science, (1993), pp. 2\u201311.","DOI":"10.1109\/SFCS.1993.366887"},{"key":"5_CR2","doi-asserted-by":"crossref","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. \u201cSearching in the plane\u201d, Information and Computation, Vol. 106, (1993), pp. 234\u2013252.","journal-title":"Information and Computation"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"A. Blum, P. Raghavan and B. Schieber. \u201cNavigating in unfamiliar geometric terrain\u201d, Proc. of 23rd Annual ACM Symp. on Theory of Computing, (1991), pp. 494\u2013504.","DOI":"10.1145\/103418.103419"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"A. Datta and Ch. Icking. \u201cCompetitive searching in a generalized street\u201d, Proc. of 10th Annual ACM Sypm. on Computational Geometry, (1994), pp. 175\u2013182.","DOI":"10.1145\/177424.177622"},{"key":"5_CR5","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. \u201cWalking an unknown street with bounded detour\u201d, Computational Geometry: Theory and Applications\n1, (1992), pp. 325\u2013351.","journal-title":"Computational Geometry: Theory and Applications"},{"key":"5_CR6","unstructured":"J. Kleinberg. \u201cOn-line search in a simple polygon\u201d, Proc. of 5th ACM-SIAM Symp. on Discrete Algorithms, (1994), pp. 8\u201315."},{"key":"5_CR7","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/BF01840369","volume":"2","author":"V. J. Lumelsky","year":"1987","unstructured":"V. J. Lumelsky and A. A. Stepanov. \u201cPath-planning strategies of a point mobile automaton moving amidst unknown obstacles of arbitrary shape\u201d, Algorithmica\n2, (1987), pp. 403\u2013430.","journal-title":"Algorithmica"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"A. Mei and Y. Igarashi. \u201cEfficient strategies for robot navigation in unknown environment\u201d Proc. of 21st International Colloquium on Automata, Languages and Programming, (1994), to appear.","DOI":"10.1007\/3-540-58201-0_104"},{"key":"5_CR9","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0304-3975(91)90263-2","volume":"84","author":"C. H. Papadimitriou","year":"1991","unstructured":"C. H. Papadimitriou and M. Yannakakis. \u201cShortest paths without a map\u201d, Theoretical Computer Science\n84, (1991), pp. 127\u2013150.","journal-title":"Theoretical Computer Science"},{"key":"5_CR10","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D. D. Sleator","year":"1985","unstructured":"D. D. Sleator and R. E. Tarjan. \u201cAmortized efficiency of list update and paging rules\u201d, Communications of the ACM\n28, (1985), pp. 202\u2013208.","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computations"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0015406","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T10:51:49Z","timestamp":1549277509000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0015406"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540605737","9783540477662"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/bfb0015406","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}