{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T03:46:40Z","timestamp":1769917600236,"version":"3.49.0"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[1986,11,1]],"date-time":"1986-11-01T00:00:00Z","timestamp":531187200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1986,11]]},"DOI":"10.1007\/bf01840435","type":"journal-article","created":{"date-parts":[[2005,7,13]],"date-time":"2005-07-13T21:29:13Z","timestamp":1121290153000},"page":"31-48","source":"Crossref","is-referenced-by-count":88,"title":["Shortest paths in euclidean graphs"],"prefix":"10.1007","volume":"1","author":[{"given":"Robert","family":"Sedgewick","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffrey Scott","family":"Vitter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01840435_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. V. Aho","year":"1974","unstructured":"A. V. Aho, J. E. Hopcroft, and J. D. Ullman.The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA (1974)."},{"key":"BF01840435_CR2","doi-asserted-by":"crossref","unstructured":"E. W. Dijkstra. A Note on Two Problems in Connexion with Graphs.Numerishe Mathematik, 1 (1959).","DOI":"10.1007\/BF01386390"},{"issue":"4","key":"BF01840435_CR3","doi-asserted-by":"crossref","first-page":"999","DOI":"10.1214\/aop\/1176993140","volume":"12","author":"R. Durrett","year":"1984","unstructured":"R. Durrett. Oriented Percolation in Two Dimensions.The Annals of Probability, 12, 4 (December 1984), 999\u20131040.","journal-title":"The Annals of Probability"},{"key":"BF01840435_CR4","unstructured":"R. J. Elliott and M. E. Lesk. Route Finding in Street Maps by Computers and People.Proc. AAAI-82 Natl. Conference in Artificial Intelligence, Pittsburgh, PA (August 1982), 258\u2013261."},{"key":"BF01840435_CR5","doi-asserted-by":"crossref","unstructured":"M. L. Fredman and R. E. Tarjan. Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms.Proc. 25th Annual Symposium on Foundations of Computer Science, West Palm Beach, FL (October 1984), 338\u2013346. The longer version of the paper will appear inJournal of the ACM.","DOI":"10.1109\/SFCS.1984.715934"},{"key":"BF01840435_CR6","doi-asserted-by":"crossref","unstructured":"H. N. Gabow, Z. Galil, and T. H. Spencer. Efficient Implementation of Graph Algorithms Using Contraction.Proc. 25th Annual Symposium on Foundations of Computer Science, West Palm Beach, FL (October 1984), 347\u2013357.","DOI":"10.1109\/SFCS.1984.715935"},{"key":"BF01840435_CR7","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1002\/net.3230080404","volume":"8","author":"B. L. Golden","year":"1978","unstructured":"B. L. Golden and M. Ball. Shortest Paths with Euclidean Distances: An Explanatory Model.Networks, 8 (1978), 297\u2013314.","journal-title":"Networks"},{"issue":"2","key":"BF01840435_CR8","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1145\/322248.322254","volume":"28","author":"G. H. Gonnet","year":"1981","unstructured":"G. H. Gonnet. Expected Length of the Longest Probe Sequence in Hash Code Searching.Journal of the ACM, 28, 2 (April 1981), 289\u2013304.","journal-title":"Journal of the ACM"},{"issue":"2","key":"BF01840435_CR9","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"P. E. Hart","year":"1968","unstructured":"P. E. Hart, N. J. Nilsson, and B. Raphael. A Formal Basis for the Heuristic Determination of Minimum Cost Paths.IEEE Transactions on Systems Science and Cybernetics, 4, 2 (July 1968), 100\u2013107.","journal-title":"IEEE Transactions on Systems Science and Cybernetics"},{"key":"BF01840435_CR10","unstructured":"E. L. Lawler, M. G. Luby, and B. Parker. Finding Shortest Paths in Very Large Networks.Proc. WG '83 Intl. Workshop on Graphtheoretic Concepts in Computer Science, Osnabr\u00fcck, West Germany (June 1983), 184\u2013199."},{"key":"BF01840435_CR11","volume-title":"Volume I. Graduate Texts in Mathematics","author":"M. Lo\u00e8ve","year":"1977","unstructured":"M. Lo\u00e8ve.Probability Theory. Volume I. Graduate Texts in Mathematics, Springer-Verlag, New York (fourth edition 1977).","edition":"fourth edition"},{"key":"BF01840435_CR12","volume-title":"Algorithms","author":"R. Sedgewick","year":"1983","unstructured":"R. Sedgewick.Algorithms. Addison-Wesley, Reading, MA (1983)."},{"key":"BF01840435_CR13","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970265","volume-title":"Data Structures and Network Algorithms","author":"R. E. Tarjan","year":"1983","unstructured":"R. E. Tarjan.Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, PA (1983)."},{"issue":"7","key":"BF01840435_CR14","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1145\/358105.893","volume":"27","author":"J. S. Vitter","year":"1984","unstructured":"J. S. Vitter. Faster Methods for Random Sampling.Communications of the ACM, 27, 7 (July 1984), 703\u2013718.","journal-title":"Communications of the ACM"},{"issue":"4","key":"BF01840435_CR15","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1137\/0211059","volume":"11","author":"A. C. Yao","year":"1982","unstructured":"A. C. Yao. On Constructing Minimum Spanning Trees ink-Dimensional Spaces and Related Problems.SIAM Journal on Computing, 11, 4 (November 1982), 721\u2013736.","journal-title":"SIAM Journal on Computing"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01840435.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01840435\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01840435","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T06:59:08Z","timestamp":1586329148000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01840435"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,11]]},"references-count":15,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[1986,11]]}},"alternative-id":["BF01840435"],"URL":"https:\/\/doi.org\/10.1007\/bf01840435","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,11]]}}}