{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:15:26Z","timestamp":1725563726480},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642157745"},{"type":"electronic","value":"9783642157752"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15775-2_38","type":"book-chapter","created":{"date-parts":[[2010,9,1]],"date-time":"2010-09-01T10:47:32Z","timestamp":1283338052000},"page":"439-450","source":"Crossref","is-referenced-by-count":0,"title":["On the Huffman and Alphabetic Tree Problem with General Cost Functions"],"prefix":"10.1007","author":[{"given":"Hiroshi","family":"Fujiwara","sequence":"first","affiliation":[]},{"given":"Tobias","family":"Jacobs","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Huffman, D.A.: A Method for the Construction of Minimum-Redundancy Codes. In: Proceedings of the I.R.E., pp. 1098\u20131101 (1952)","key":"38_CR1","DOI":"10.1109\/JRPROC.1952.273898"},{"key":"38_CR2","doi-asserted-by":"crossref","first-page":"933","DOI":"10.1002\/j.1538-7305.1959.tb01583.x","volume":"38","author":"E.N. Gilbert","year":"1959","unstructured":"Gilbert, E.N., Moore, E.F.: Variable Length Binary Encodings. Bell System Tech. J.\u00a038, 933\u2013968 (1959)","journal-title":"Bell System Tech. J."},{"key":"38_CR3","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/BF00264289","volume":"1","author":"D.E. Knuth","year":"1971","unstructured":"Knuth, D.E.: Optimum Binary Search Trees. Acta Informatica\u00a01, 14\u201325 (1971)","journal-title":"Acta Informatica"},{"issue":"4","key":"38_CR4","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1137\/0121057","volume":"21","author":"T.C. Hu","year":"1971","unstructured":"Hu, T.C., Tucker, A.C.: Optimal Computer Search Trees and Variable-Length Alphabetical Codes. SIAM Journal on Applied Mathematics\u00a021(4), 514\u2013532 (1971)","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"38_CR5","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, pp. 85\u2013103. Plenum Press, New York (1972)"},{"issue":"2","key":"38_CR6","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0012-365X(87)90137-3","volume":"65","author":"P. Flajolet","year":"1987","unstructured":"Flajolet, P., Prodinger, H.: Level Number Sequences for Trees. Discrete Mathematics\u00a065(2), 149\u2013156 (1987)","journal-title":"Discrete Mathematics"},{"unstructured":"Klawe, M.M., Mumey, B.: Upper and Lower Bounds on Constructing Alphabetical Binary Trees. In: Proc. 4th ACM-SIAM Symposium on Discrete Algorithms, pp. 185\u2013193 (1993)","key":"38_CR7"},{"key":"38_CR8","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1137\/0125012","volume":"25","author":"T.C. Hu","year":"1973","unstructured":"Hu, T.C.: A New Proof of the T-C Algorithm. SIAM J. Appl. Math\u00a025, 83\u201394 (1973)","journal-title":"SIAM J. Appl. Math"},{"issue":"2","key":"38_CR9","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1137\/0137015","volume":"37","author":"T.C. Hu","year":"1979","unstructured":"Hu, T.C., Kleitman, D.J., Tamaki, J.K.: Binary Trees Optimum Under Various Criteria. SIAM Journal on Applied Mathematics\u00a037(2), 246\u2013256 (1979)","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"38_CR10","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.tcs.2003.06.001","volume":"321","author":"R. Carmo","year":"2004","unstructured":"Carmo, R., Donaldelli, J., Kohayakawa, Y., Laber, E.: Searching in Random Partially Ordered Sets. Theor. Comp. Science\u00a0321, 41\u201357 (2004)","journal-title":"Theor. Comp. Science"},{"doi-asserted-by":"crossref","unstructured":"Chakaravarthy, V., Pandit, V., Roy, S., Awasthi, P., Mohania, M.: Decision Trees for Entity Identification: Approximation Algorithms and Hardness Results. In: Proceedings of PODS (2007)","key":"38_CR11","DOI":"10.1145\/1265530.1265538"},{"unstructured":"Mozes, S., Onak, K., Weizmann, O.: Finding an Optimal Tree Searching Strategy in Linear Time. In: Proceedings of SODA (2008)","key":"38_CR12"},{"key":"38_CR13","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques","author":"M. Adler","year":"2008","unstructured":"Adler, M., Heeringa, B.: Approximating Optimal Binary Decision Trees. In: Goel, A., Jansen, K., Rolim, J.D.P., Rubinfeld, R. (eds.) APPROX and RANDOM 2008. LNCS, vol.\u00a05171, pp. 1\u20139. Springer, Heidelberg (2008)"},{"doi-asserted-by":"crossref","unstructured":"Chakaravarthy, V., Pandit, V., Roy, S., Sabharwal., Y.: Approximating Decision Trees with Multiway Branches. In: Proceedings of ICALP (2009)","key":"38_CR14","DOI":"10.1007\/978-3-642-02927-1_19"},{"issue":"4","key":"38_CR15","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.ipl.2009.11.008","volume":"110","author":"M.B. Baer","year":"2010","unstructured":"Baer, M.B.: Alphabetic Coding with Exponential Costs. Information Processing Letters\u00a0110(4), 139\u2013142 (2010)","journal-title":"Information Processing Letters"},{"unstructured":"Cicalese, F., Jacobs, T., Laber, E., Molinaro, M.: On The Complexity of Searching in Trees: Average-case Minimization. In: Proceedings of ICALP 2010 (to appear, 2010)","key":"38_CR16"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15775-2_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T20:18:44Z","timestamp":1559506724000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15775-2_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642157745","9783642157752"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15775-2_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}