{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:31:25Z","timestamp":1759638685352},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2005,10,26]],"date-time":"2005-10-26T00:00:00Z","timestamp":1130284800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Math Model Algor"],"published-print":{"date-parts":[[2005,12,8]]},"DOI":"10.1007\/s10852-005-0855-4","type":"journal-article","created":{"date-parts":[[2005,10,31]],"date-time":"2005-10-31T10:22:04Z","timestamp":1130754124000},"page":"331-353","source":"Crossref","is-referenced-by-count":1,"title":["Exact and Heuristic Algorithms for Dynamic Tree Simplification"],"prefix":"10.1007","volume":"4","author":[{"given":"Carlos","family":"Correa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivan","family":"Marsic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaodong","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,10,26]]},"reference":[{"issue":"4","key":"10855_CR1","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1287\/ijoc.9.4.431","volume":"9","author":"G. Cho","year":"1997","unstructured":"Cho, G. and Shaw, D. X.: A depth-first dynamic programming algorithm for the tree knapsack problem, INFORMS J. Computing 9(4) (1997), 431\u2013438.","journal-title":"INFORMS J. Computing"},{"key":"10855_CR2","doi-asserted-by":"crossref","unstructured":"Funkhouser, T. and Sequin, C. H.: Adaptive display algorithm for interactive frame rates during visualization of complex virtual environments, in Proceedings of the SIGGRAPH Computer Graphics Annual Conference, ACM Press, New York, pp. 99\u2013108.","DOI":"10.1145\/166117.166149"},{"key":"10855_CR3","volume-title":"Computers and Intractability. A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R. and Johnson, D. S.: Computers and Intractability. A Guide to the Theory of NP-Completeness, Freeman and Company, San Francisco, CA, 1979."},{"key":"10855_CR4","volume-title":"Linear Programming","author":"J. P. Ignizio","year":"1994","unstructured":"Ignizio, J. P. and Cavalier, T. M.: Linear Programming, Prentice-Hall, Englewood Cliffs, NJ, 1994."},{"issue":"1","key":"10855_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/moor.8.1.1","volume":"8","author":"D. S. Johnson","year":"1983","unstructured":"Johnson, D. S. and Niemi, K. A.: On knapsacks, partitions, and a new dynamic programming technique for trees, Math. Oper. Res. 8(1) (1983), 1\u201314.","journal-title":"Math. Oper. Res."},{"key":"10855_CR6","volume-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"S. Martello","year":"1990","unstructured":"Martello, S. and Toth, P.: Knapsack Problems: Algorithms and Computer Implementations, Wiley, New York, 1990."},{"issue":"1","key":"10855_CR7","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1109\/2945.910824","volume":"7","author":"A. E. W. Mason","year":"2001","unstructured":"Mason, A. E. W. and Blake, E. H.: A graphical representation of the state spaces of hierarchical level-of-detail scene descriptions, IEEE Trans. Visual. Computer Graph. 7(1) (2001), 70\u201375.","journal-title":"IEEE Trans. Visual. Computer Graph."},{"issue":"3","key":"10855_CR8","doi-asserted-by":"crossref","first-page":"659","DOI":"10.1023\/A:1004649425222","volume":"105","author":"N. Samphaiboon","year":"2000","unstructured":"Samphaiboon, N. and Yamada, T.: Heuristic and exact algorithms for the precedence-constrained knapsack problem, J. Optim. Theory Appl. 105(3) (2000), 659\u2013676.","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"10855_CR9","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1002\/(SICI)1097-0037(199807)31:4<205::AID-NET1>3.0.CO;2-H","volume":"31","author":"D. X. Shaw","year":"1998","unstructured":"Shaw, D. X. and Cho, G.: The critical-item, upper bounds, and a branch-and-bound algorithm for the tree knapsack problem, Networks 31(4) (1998), 205\u2013216.","journal-title":"Networks"}],"container-title":["Journal of Mathematical Modelling and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-005-0855-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10852-005-0855-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-005-0855-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T02:26:28Z","timestamp":1559269588000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10852-005-0855-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,10,26]]},"references-count":9,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2005,12,8]]}},"alternative-id":["855"],"URL":"https:\/\/doi.org\/10.1007\/s10852-005-0855-4","relation":{},"ISSN":["1570-1166","1572-9214"],"issn-type":[{"value":"1570-1166","type":"print"},{"value":"1572-9214","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,10,26]]}}}