{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:46:52Z","timestamp":1725536812616},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642038150"},{"type":"electronic","value":"9783642038167"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","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-03816-7_59","type":"book-chapter","created":{"date-parts":[[2009,8,19]],"date-time":"2009-08-19T14:43:03Z","timestamp":1250692983000},"page":"700-711","source":"Crossref","is-referenced-by-count":2,"title":["Partial Solution and Entropy"],"prefix":"10.1007","author":[{"given":"Tadao","family":"Takaoka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"59_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/3-540-58325-4_210","volume-title":"Algorithms and Computation","author":"D. Abuaiadh","year":"1994","unstructured":"Abuaiadh, D., Kingston, J.H.: Are Fibonacci heaps optimal? In: Du, D.-Z., Zhang, X.-S. (eds.) ISAAC 1994. LNCS, vol.\u00a0834, pp. 442\u2013450. Springer, Heidelberg (1994)"},{"key":"59_CR2","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 connection with graphs. Numer. Math.\u00a01, 269\u2013271 (1959)","journal-title":"Numer. Math."},{"key":"59_CR3","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1145\/146370.146381","volume":"24","author":"V. Estivill-Castro","year":"1992","unstructured":"Estivill-Castro, V., Wood, D.: A survey of adaptive sorting algorithms. ACM Computing Surveys\u00a024, 441\u2013476 (1992)","journal-title":"ACM Computing Surveys"},{"issue":"3","key":"59_CR4","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M.L. Fredman","year":"1987","unstructured":"Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their use in improved network optimization problems. J. ACM\u00a034(3), 596\u2013615 (1987)","journal-title":"J. ACM"},{"key":"59_CR5","series-title":"Sorting and Searching","volume-title":"The Art of Computer Programming","author":"D.E. Knuth","year":"1974","unstructured":"Knuth, D.E.: The Art of Computer Programming. Sorting and Searching, vol.\u00a03. Addison-Wesley, Reading (1974)"},{"key":"59_CR6","doi-asserted-by":"crossref","unstructured":"Mannila, H.: Measures of presortedness and optimal sorting algorithms. IEEE Trans. Comput. C-34, 318\u2013325 (1985)","DOI":"10.1109\/TC.1985.5009382"},{"key":"59_CR7","unstructured":"Nakagawa, Y.: A Difficulty Estimation Method for Multidimensional Nonlinear 0-1 Knapsack Problem Using Entropy. Transactions of the Institute of Electronics, Communication and Information\u00a0J87-A(3), 406\u2013408 (2004)"},{"issue":"1-3","key":"59_CR8","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.tcs.2006.10.008","volume":"370","author":"S. Saunders","year":"2007","unstructured":"Saunders, S., Takaoka, T.: Solving shortest paths efficiently on nearly acyclic directed graphs. Theoretical Computer Science\u00a0370(1-3), 94\u2013109 (2007)","journal-title":"Theoretical Computer Science"},{"key":"59_CR9","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-3 Heaps. Discrete Applied Math.\u00a0126, 115\u2013128 (2003)","journal-title":"Discrete Applied Math."},{"key":"59_CR10","unstructured":"Takaoka, T.: Entropy \u2013 Measure of Disorder. In: Proc. CATS (Computation: Australasian Theory Symposium), pp. 77\u201385 (1998)"},{"key":"59_CR11","doi-asserted-by":"crossref","unstructured":"Tarjan, R.E.: Data Structures and Network Algorithms, Regional Conference Series in Applied math. 44 (1983)","DOI":"10.1137\/1.9781611970265"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03816-7_59","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T02:33:49Z","timestamp":1558492429000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03816-7_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642038150","9783642038167"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03816-7_59","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}