{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T19:40:02Z","timestamp":1748461202342,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662476710"},{"type":"electronic","value":"9783662476727"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-47672-7_56","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T10:07:39Z","timestamp":1434708459000},"page":"689-700","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Hollow Heaps"],"prefix":"10.1007","author":[{"given":"Thomas Dueholm","family":"Hansen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haim","family":"Kaplan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert E.","family":"Tarjan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uri","family":"Zwick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"key":"56_CR1","unstructured":"Brodal, G.S.: Worst-case efficient priority queues. In: Proceedings of the 7th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 52\u201358 (1996)"},{"key":"56_CR2","doi-asserted-by":"crossref","unstructured":"Brodal, G.S., Lagogiannis, G., Tarjan, R.E.: Strict Fibonacci heaps. In: Proc. of the 44th ACM STOC, pp. 1177\u20131184 (2012)","DOI":"10.1145\/2213977.2214082"},{"key":"56_CR3","doi-asserted-by":"crossref","unstructured":"Chan, T.M.: Quake heaps: a simple alternative to fibonacci heaps. In: Brodnik, A., L\u00f3pez-Ortiz, A., Raman, V., Viola, A. (eds.) Space-Efficient Data Structures, Streams, and Algorithms. LNCS, vol. 8066, pp. 27\u201332. Springer, Heidelberg (2013)","DOI":"10.1007\/978-3-642-40273-9_3"},{"key":"56_CR4","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1, 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"issue":"11","key":"56_CR5","doi-asserted-by":"publisher","first-page":"1343","DOI":"10.1145\/50087.50096","volume":"31","author":"JR Driscoll","year":"1988","unstructured":"Driscoll, J.R., Gabow, H.N., Shrairman, R., Tarjan, R.E.: Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation. Communications of the ACM 31(11), 1343\u20131354 (1988)","journal-title":"Communications of the ACM"},{"key":"56_CR6","doi-asserted-by":"publisher","first-page":"233","DOI":"10.6028\/jres.071B.032","volume":"71B","author":"J Edmonds","year":"1967","unstructured":"Edmonds, J.: Optimum branchings. J. Res. Nat. Bur. Standards 71B, 233\u2013240 (1967)","journal-title":"J. Res. Nat. Bur. Standards"},{"key":"56_CR7","doi-asserted-by":"crossref","unstructured":"Elmasry, A.: The violation heap: a relaxed Fibonacci-like heap. Discrete Math., Alg. and Appl. 2(4), 493\u2013504 (2010)","DOI":"10.1142\/S1793830910000838"},{"issue":"3","key":"56_CR8","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"ML Fredman","year":"1987","unstructured":"Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM 34(3), 596\u2013615 (1987)","journal-title":"Journal of the ACM"},{"key":"56_CR9","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF02579168","volume":"6","author":"HN Gabow","year":"1986","unstructured":"Gabow, H.N., Galil, Z., Spencer, T.H., Tarjan, R.E.: Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. Combinatorica 6, 109\u2013122 (1986)","journal-title":"Combinatorica"},{"issue":"6","key":"56_CR10","doi-asserted-by":"publisher","first-page":"1463","DOI":"10.1137\/100785351","volume":"40","author":"B Haeupler","year":"2011","unstructured":"Haeupler, B., Sen, S., Tarjan, R.E.: Rank-pairing heaps. SIAM Journal on Computing 40(6), 1463\u20131485 (2011)","journal-title":"SIAM Journal on Computing"},{"key":"56_CR11","doi-asserted-by":"crossref","unstructured":"H\u00f8yer, P.: A general technique for implementation of efficient priority queues. In: Proceedings of the 3rd Israeli Symposium on the Theory of Computing and Systems (ISTCS), pp. 57\u201366 (1995)","DOI":"10.1109\/ISTCS.1995.377045"},{"key":"56_CR12","doi-asserted-by":"crossref","unstructured":"Kaplan, H., Shafrir, N., Tarjan, R.E.: Meldable heaps and boolean union-find. In: Proc. of the 34th ACM STOC, pp. 573\u2013582 (2002)","DOI":"10.1145\/509907.509990"},{"issue":"1","key":"56_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1328911.1328914","volume":"4","author":"H Kaplan","year":"2008","unstructured":"Kaplan, H., Tarjan, R.E.: Thin heaps, thick heaps. ACM Transactions on Algorithms 4(1), 1\u201314 (2008)","journal-title":"ACM Transactions on Algorithms"},{"key":"56_CR14","unstructured":"Kaplan, H., Tarjan, R.E., Zwick, U.: Fibonacci heaps revisited. CoRR, abs\/1407.5750 (2014)"},{"key":"56_CR15","unstructured":"Knuth, D.E.: Sorting and searching. The art of computer programming, vol. 3, 2nd edn. Addison-Wesley (1998)"},{"key":"56_CR16","unstructured":"Peterson, G.L.: A balanced tree scheme for meldable heaps with updates. Technical Report GIT-ICS-87-23, School of Informatics and Computer Science, Georgia Institute of Technology, Atlanta, GA (1987)"},{"key":"56_CR17","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"RC Prim","year":"1957","unstructured":"Prim, R.C.: Shortest connection networks and some generalizations. Bell System Technical Journal 36, 1389\u20131401 (1957)","journal-title":"Bell System Technical Journal"},{"issue":"1","key":"56_CR18","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/S0166-218X(02)00219-6","volume":"126","author":"T Takaoka","year":"2003","unstructured":"Takaoka, T.: Theory of 2\u20133 heaps. Discrete Appl. Math. 126(1), 115\u2013128 (2003)","journal-title":"Discrete Appl. Math."},{"key":"56_CR19","doi-asserted-by":"crossref","unstructured":"Tarjan, R.E.: Data structures and network algorithms. SIAM (1983)","DOI":"10.1137\/1.9781611970265"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-47672-7_56","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T19:09:47Z","timestamp":1748459387000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-47672-7_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662476710","9783662476727"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-47672-7_56","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}