{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:09:56Z","timestamp":1725664196440},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540606925"},{"type":"electronic","value":"9783540492634"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60692-0_38","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T20:52:59Z","timestamp":1330289579000},"page":"22-36","source":"Crossref","is-referenced-by-count":1,"title":["A near optimal algorithm for the extended cow-path problem in the presence of relative errors"],"prefix":"10.1007","author":[{"given":"Pallab","family":"Dasgupta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P. P.","family":"Chakrabarti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. C.","family":"DeSarkar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1006\/inco.1993.1054","volume":"106","author":"R. A. Baeza-Yates","year":"1993","unstructured":"Baeza-Yates, R. A., J.C.Culberson, and G.J.E.Rawlins. Searching in the plane. Information and Computation 106 (1993), 234\u2013252.","journal-title":"Information and Computation"},{"doi-asserted-by":"crossref","unstructured":"Blum, A., P.Raghavan, and B.Schieber. Navigating in unfamiliar geometric terrains. In STOC (1991), pp. 494\u2013504.","key":"3_CR2","DOI":"10.1145\/103418.103419"},{"key":"3_CR3","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0004-3702(94)90066-3","volume":"71","author":"P. Dasgupta","year":"1994","unstructured":"Dasgupta, P., P.P.Chakrabarti, and S.C.DeSarkar. Agent searching in a tree and the optimality of iterative deepening. Artificial Intelligence 71 (1994), 195\u2013208.","journal-title":"Artificial Intelligence"},{"issue":"3","key":"3_CR4","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1145\/3828.3830","volume":"32","author":"R. Dechter","year":"1985","unstructured":"Dechter, R., and J.Pearl. Generalized best-first search strategies and the optimality of A\n*. JACM 32, 3 (1985), 505\u2013536.","journal-title":"JACM"},{"doi-asserted-by":"crossref","unstructured":"Fiat, A., D.P.Foster, H.Karloff, Y.Rabani, Y.Ravid, and S.Vishwanathan. Competitive algorithms for layered graph traversal. In FOCS (1991), pp. 288\u2013297.","key":"3_CR5","DOI":"10.1109\/SFCS.1991.185381"},{"doi-asserted-by":"crossref","unstructured":"Fiat, A., Y.Rabani, and Y.Ravid. Competitive k-server algorithms. In FOCS (1990), pp. 454\u2013463.","key":"3_CR6","DOI":"10.1109\/FSCS.1990.89566"},{"key":"3_CR7","volume-title":"Tech. Rep. TCS-94\/2","author":"S. K. Ghosh","year":"1994","unstructured":"Ghosh, S. K., and S.Saluja. Optimal on-line algorithms for walking with minimum number of turns in unknown streets. Tech. Rep. TCS-94\/2, TIFR, Bombay, 1994."},{"unstructured":"Kao, M. Y., J.H.Reif, and S.R.Tate. Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem. In SODA (1992), pp. 441\u2013447.","key":"3_CR8"},{"unstructured":"Karp, R. M., M.Saks, and A.Widgerson. On a search problem related to branchand-bound procedures. In Proc. of 27th Annual Symp. on Foundations of Computer Science (1986), pp. 19\u201328.","key":"3_CR9"},{"key":"3_CR10","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/0925-7721(92)90010-P","volume":"1","author":"R. Klein","year":"1992","unstructured":"Klein, R. Walking an unknown street with bounded detour. Computational Geometry: Theory and Applications 1 (1992), 325\u2013351.","journal-title":"Computational Geometry: Theory and Applications"},{"unstructured":"Kleinberg, J. M. On-line search in a simple polygon. In Proc. of SODA'94 (1994), pp. 8\u201315.","key":"3_CR11"},{"key":"3_CR12","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","volume":"27","author":"R. E. Korf","year":"1985","unstructured":"Korf, R. E. Depth-first iterative deepening: An optimal admissible tree search. Artificial Intelligence 27 (1985), 97\u2013109.","journal-title":"Artificial Intelligence"},{"unstructured":"Papadimitriou, C. H. Shortest path motion. In Proc. FST-TCS Conference, New Delhi (1987).","key":"3_CR13"},{"key":"3_CR14","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0304-3975(91)90263-2","volume":"84","author":"C. H. Papadimitriou","year":"1991","unstructured":"Papadimitriou, C. H., and M.Yannakakis. Shortest paths without a map. Theoretical Computer Science 84 (1991), 127\u2013150.","journal-title":"Theoretical Computer Science"},{"unstructured":"Pearl, J. Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison Wesley, 1984.","key":"3_CR15"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60692-0_38.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:26:58Z","timestamp":1619573218000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60692-0_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540606925","9783540492634"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-60692-0_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}