{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:48:39Z","timestamp":1743014919963,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642020254"},{"type":"electronic","value":"9783642020261"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02026-1_17","type":"book-chapter","created":{"date-parts":[[2009,6,17]],"date-time":"2009-06-17T16:31:23Z","timestamp":1245256283000},"page":"186-196","source":"Crossref","is-referenced-by-count":0,"title":["Two-Level Heaps: A New Priority Queue Structure with Applications to the Single Source Shortest Path Problem"],"prefix":"10.1007","author":[{"given":"K.","family":"Subramani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kamesh","family":"Madduri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","volume-title":"Introduction to Algorithms.","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2001)"},{"issue":"3","key":"17_CR2","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1137\/S0097539792231179","volume":"24","author":"A.V. Goldberg","year":"1995","unstructured":"Goldberg, A.V.: Scaling algorithms for the shortest paths problem. SIAM Journal on Computing\u00a024(3), 494\u2013504 (1995)","journal-title":"SIAM Journal on Computing"},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik\u00a01, 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1145\/261342.261352","volume":"28","author":"R. Raman","year":"1997","unstructured":"Raman, R.: Recent results in single-source shortest paths problem. SIGACT news\u00a028, 81\u201387 (1997)","journal-title":"SIGACT news"},{"issue":"2","key":"17_CR5","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1145\/77600.77615","volume":"37","author":"R.K. Ahuja","year":"1990","unstructured":"Ahuja, R.K., Mehlhorn, K., Orlin, J.B., Tarjan, R.E.: Faster algorithms for the shortest path problem. Journal of the ACM\u00a037(2), 213\u2013223 (1990)","journal-title":"Journal of the ACM"},{"key":"17_CR6","first-page":"257","volume":"14","author":"S. Pallottino","year":"1984","unstructured":"Pallottino, S.: Shortest path methods: Complexity, interrelations and new propositions. NETWORKS: Networks: An International Journal\u00a014, 257\u2013267 (1984)","journal-title":"NETWORKS: Networks: An International Journal"},{"key":"17_CR7","unstructured":"Park, J., Penner, M., Prasanna, V.: Optimizing graph algorithms for improved cache performance. In: Proc. Int\u2019l Parallel and Distributed Processing Symp. (IPDPS 2002), Fort Lauderdale, FL (April 2002)"},{"key":"17_CR8","unstructured":"Demetrescu, C., Goldberg, A., Johnson, D.: 9th DIMACS implementation challenge \u2013 Shortest Paths, \n                      http:\/\/www.dis.uniroma1.it\/~challenge9\/"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Chakrabarti, D., Zhan, Y., Faloutsos, C.: R-MAT: A recursive model for graph mining. In: Proc. 4th SIAM Intl. Conf. on Data Mining, Florida, USA (April 2004)","DOI":"10.1137\/1.9781611972740.43"},{"key":"17_CR10","first-page":"129","volume":"73","author":"B. Cherkassky","year":"1996","unstructured":"Cherkassky, B., Goldberg, A., Radzik, T.: Shortest paths algorithms: theory and experimental evaluation. Mathematical Programming\u00a073, 129\u2013174 (1996)","journal-title":"Mathematical Programming"},{"key":"17_CR11","unstructured":"Goldberg, A.: Network optimization library, \n                      http:\/\/www.avglab.com\/andrew\/soft.html"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02026-1_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T03:55:06Z","timestamp":1714622106000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-02026-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642020254","9783642020261"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02026-1_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}