{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:51:24Z","timestamp":1725565884009},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540228493"},{"type":"electronic","value":"9783540278368"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27836-8_64","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T18:53:21Z","timestamp":1284576801000},"page":"757-769","source":"Crossref","is-referenced-by-count":4,"title":["Optimal Website Design with the Constrained Subtree Selection Problem"],"prefix":"10.1007","author":[{"given":"Brent","family":"Heeringa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Micah","family":"Adler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"64_CR1","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0004-3702(99)00098-3","volume":"118","author":"M. Perkowitz","year":"2000","unstructured":"Perkowitz, M., Etzioni, O.: Towards adaptive web sites: Conceptual framework and case study. Artificial Intelligence\u00a0118, 245\u2013275 (2000)","journal-title":"Artificial Intelligence"},{"key":"64_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/3-540-40996-3_3","volume-title":"Algorithms and Computation","author":"P. Bose","year":"2000","unstructured":"Bose, P., Czyzowicz, J., Gasienicz, L., Kranakis, E., Krizanc, D., Pelc, A., Martin, M.V.: Strategies for hotlink assignments. In: Lee, D.T., Teng, S.-H. (eds.) ISAAC 2000. LNCS, vol.\u00a01969, pp. 23\u201334. Springer, Heidelberg (2000)"},{"key":"64_CR3","unstructured":"Czyzowicz, J., Kranakis, E., Krizanc, D., Pelc, A., Martin, M.V.: Evaluation of hotlink assignment heuristics for improving web access. In: Second International Conference on Internet Computing, pp. 793\u2013799. CSREA Press (2001)"},{"key":"64_CR4","first-page":"93","volume":"1","author":"J. Czyzowicz","year":"2003","unstructured":"Czyzowicz, J., Kranakis, E., Krizanc, D., Pelc, A., Martin, M.V.: Enhancing hyperlink structure for improving web performance. Journal of Web Engineering\u00a01, 93\u2013127 (2003)","journal-title":"Journal of Web Engineering"},{"key":"64_CR5","doi-asserted-by":"crossref","unstructured":"Karp, R.: Minimum-redundancy coding for the discrete noiseless channel. IRE Transactions on Information Theory IT, 27\u201329 (1961)","DOI":"10.1109\/TIT.1961.1057615"},{"key":"64_CR6","doi-asserted-by":"publisher","first-page":"785","DOI":"10.1145\/509907.510020","volume-title":"Proceedings of the thiry-fourth annual ACM symposium on Theory of computing","author":"M.J. Golin","year":"2002","unstructured":"Golin, M.J., Kenyon, C., Young, N.E.: Huffman coding with unequal letter costs. In: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, pp. 785\u2013791. ACM Press, New York (2002)"},{"key":"64_CR7","doi-asserted-by":"publisher","first-page":"1770","DOI":"10.1109\/18.705558","volume":"44","author":"M.J. Golin","year":"1998","unstructured":"Golin, M.J., Rote, G.: A dynamic programming algorithm for constructing optimal prefix-free codes with unequal letter costs. IEEE Transactions on Information Theory\u00a044, 1770\u20131781 (1998)","journal-title":"IEEE Transactions on Information Theory"},{"key":"64_CR8","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)"},{"key":"64_CR9","doi-asserted-by":"crossref","unstructured":"Heeringa, B., Adler, M.: Optimal website design with the constrained subtree selection problem. Technical Report 04-09, University of Massachusetts Amherst (2004)","DOI":"10.1007\/978-3-540-27836-8_64"},{"key":"64_CR10","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. 2 edn. The MIT Press\/McGraw-Hill Book Company (2001)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27836-8_64.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:24:03Z","timestamp":1605741843000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27836-8_64"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228493","9783540278368"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27836-8_64","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}