{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,28]],"date-time":"2026-07-28T18:50:12Z","timestamp":1785264612602,"version":"3.55.0"},"reference-count":18,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,7,1]],"date-time":"1991-07-01T00:00:00Z","timestamp":678326400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8052,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1991,7]]},"DOI":"10.1016\/0304-3975(91)90263-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"127-150","source":"Crossref","is-referenced-by-count":278,"title":["Shortest paths without a map"],"prefix":"10.1016","volume":"84","author":[{"given":"Christos H.","family":"Papadimitriou","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mihalis","family":"Yannakakis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(91)90263-2_BIB1","first-page":"176","article-title":"Searching with uncertainty","author":"Baeza-Yates","year":"1988","journal-title":"Proc. Scandinavian Workshop on Algorithm Theory"},{"key":"10.1016\/0304-3975(91)90263-2_BIB2","doi-asserted-by":"crossref","unstructured":"A. Borodin, N. Linial and M.E. Saks, An optimal online algorithm for metrical task systems, SIAM J. Comput., to appear.","DOI":"10.1145\/28395.28435"},{"key":"10.1016\/0304-3975(91)90263-2_BIB3","first-page":"49","article-title":"New lower bound techniques for robot motion planning problems","author":"Canny","year":"1987","journal-title":"Proc. FOCS"},{"key":"10.1016\/0304-3975(91)90263-2_BIB4","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1287\/opre.17.3.395","article-title":"An appraisal of some shortest path algorithms","volume":"17","author":"Dreyfus","year":"1969","journal-title":"Operations Research"},{"key":"10.1016\/0304-3975(91)90263-2_BIB5","first-page":"453","article-title":"Evading convex discs","volume":"13","author":"Fejes Toth","year":"1978","journal-title":"Studia Sci. Math. Hungar."},{"key":"10.1016\/0304-3975(91)90263-2_BIB6","series-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0304-3975(91)90263-2_BIB7","series-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler","year":"1977"},{"key":"10.1016\/0304-3975(91)90263-2_BIB8","first-page":"322","article-title":"Competitive algorithms for on-line problems","author":"Manasse","year":"1988","journal-title":"Proc. 20th STOC"},{"key":"10.1016\/0304-3975(91)90263-2_BIB9","article-title":"Shortest paths in the plane among obstacles","author":"Mitchell","year":"1986","journal-title":"Technical Report"},{"key":"10.1016\/0304-3975(91)90263-2_BIB10","article-title":"Planning shortest paths","author":"Mitchell","year":"1987","journal-title":"PhD dissertation"},{"key":"10.1016\/0304-3975(91)90263-2_BIB11","doi-asserted-by":"crossref","DOI":"10.1137\/0216045","article-title":"The discrete geodesic problem","author":"Mitchell","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(91)90263-2_BIB12","article-title":"The weighted regions problem","author":"Mitchell","year":"1991","journal-title":"J.ACM"},{"key":"10.1016\/0304-3975(91)90263-2_BIB13","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0020-0190(85)90029-8","article-title":"An algorithm for shortest-path motion in three dimensions","volume":"20","author":"Papadimitriou","year":"1985","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"10.1016\/0304-3975(91)90263-2_BIB14","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/0022-0000(85)90045-5","article-title":"Games against nature","volume":"31","author":"Papadimitriou","year":"1985","journal-title":"J. Computer System Sci."},{"key":"10.1016\/0304-3975(91)90263-2_BIB15","article-title":"Shortest path motion","author":"Papadimitriou","year":"1987","journal-title":"Proc. 1987 FST-TCS Conf. New Delhi"},{"key":"10.1016\/0304-3975(91)90263-2_BIB16","series-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/0304-3975(91)90263-2_BIB17","series-title":"Heuristics","author":"Pearl","year":"1984"},{"key":"10.1016\/0304-3975(91)90263-2_BIB18","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","article-title":"Amortized efficiency of list update and paging rules","volume":"23","author":"Sleator","year":"1985","journal-title":"Comm. ACM"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397591902632?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397591902632?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:54:17Z","timestamp":1555113257000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397591902632"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,7]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,7]]}},"alternative-id":["0304397591902632"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(91)90263-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1991,7]]}}}