Abstract
The Tree Knapsack Problem (TKP) is a 0???1 integer programming problem where hierarchy constraints are enforced. If a node is selected for packing into the knapsack, all the ancestor nodes on the path from the root to the selected node are packed as well. One apparent application of this problem is the simplification of computer graphics models. Real applications also use alternative representations of the nodes or whole subtrees, called impostors, to provide simplified trees that are visually acceptable. To account for this simplification, we introduce a generalized TKP, called Exclusive Multiple Choice Tree Knapsack Problem (EMCTKP). We present a dynamic programming algorithm to solve EMCTKP and a heuristic, called Lazy Iterative Arrangement, which reuses previous EMCTKP solutions to solve new instances of the problem. We show that this algorithm and heuristic reduce significantly the computation time of EMCTKP problems when changes in their parameters have spatial and temporal coherence. We also compare our algorithm with commercial integer programming solvers, and show that in our case the computation time grows linearly with the size of the problem tree and the available resources, while for generic IP solvers it is unpredictable and varies over a wide range of values.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Cho, G. and Shaw, D. X.: A depth-first dynamic programming algorithm for the tree knapsack problem, INFORMS J. Computing 9(4) (1997), 431???438.
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???108.
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.
Ignizio, J. P. and Cavalier, T. M.: Linear Programming, Prentice-Hall, Englewood Cliffs, NJ, 1994.
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???14.
Martello, S. and Toth, P.: Knapsack Problems: Algorithms and Computer Implementations, Wiley, New York, 1990.
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???75.
Samphaiboon, N. and Yamada, T.: Heuristic and exact algorithms for the precedence-constrained knapsack problem, J. Optim. Theory Appl. 105(3) (2000), 659???676.
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???216.
Author information
Authors and Affiliations
Corresponding author
Additional information
Mathematics Subject Classifications (2000)
90-08, 90C10, 90C90.
Xiaodong Sun: Most of the work was done while at Rutgers University and Institute for Advanced Study.
Rights and permissions
About this article
Cite this article
Correa, C., Marsic, I. & Sun, X. Exact and Heuristic Algorithms for Dynamic Tree Simplification. J Math Model Algor 4, 331–353 (2005). https://doi.org/10.1007/s10852-005-0855-4
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10852-005-0855-4