{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:59:39Z","timestamp":1725562779802},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540642305"},{"type":"electronic","value":"9783540697053"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0028545","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T07:33:39Z","timestamp":1132644819000},"page":"14-24","source":"Crossref","is-referenced-by-count":8,"title":["Floats, integers, and single source shortest paths"],"prefix":"10.1007","author":[{"given":"Mikkel","family":"Thorup","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,20]]},"reference":[{"key":"3_CR1","first-page":"25","volume":"136","author":"S. Albers","year":"1997","unstructured":"S. Albers and T. Hagerup, Improved parallel integer sorting without concurrent writing, Information and Control136 (1997) 25\u201351.","journal-title":"Information and Control"},{"key":"3_CR2","unstructured":"E. Althaus and K. Mehlhorn, Maximum Network Flow with Floating Point Arithmetic, Max-Plank-Institut f\u00fcr Informatik, Technical Report MPI-I-97-1-022, 1997."},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"E.W. Dijkstra, A note on two problems in connection with graphs, Numer. Math.1 (1959), 269\u2013271.","journal-title":"Numer. Math."},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/S0022-0000(05)80064-9","volume":"48","author":"M.L. Fredman","year":"1994","unstructured":"M.L. Fredman and D.E. Willard, Trans-dichotomous algorithms for minimum spanning trees and shortest paths, J. Comp. Syst. Sc.48 (1994) 533\u2013551.","journal-title":"J. Comp. Syst. Sc."},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1145\/201019.201022","volume":"42","author":"D.R. Karger","year":"1995","unstructured":"D.R. Karger, P.N. Klein, and R.E. Tarjan, A Randomized LinearTime Algorithm to Find Minimum Spanning Trees J. ACM, 42:321\u2013328, 1995.","journal-title":"J. ACM"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"M. Thorup. Undirected Single Source Shortest Paths in Linear Time. In Proceedings of the 38th IEEE Symposium on Foundations of Computer Science (FOCS), pages 12\u201321, 1997.","DOI":"10.1109\/SFCS.1997.646088"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/BF01683268","volume":"10","author":"P. Emde Boas van","year":"1977","unstructured":"P. van Emde Boas, R. Kaas, and E. Zijlstra, Design and implementation of an efficient priority queue, Math. Syst. Th.10 (1977), 99\u2013127.","journal-title":"Math. Syst. Th."}],"container-title":["Lecture Notes in Computer Science","STACS 98"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0028545","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T22:30:29Z","timestamp":1552948229000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0028545"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540642305","9783540697053"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/bfb0028545","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}