Exact and heuristic algorithms for dynamic tree simplification

DOI10.1007/S10852-005-0855-4MaRDI QIDQ2583510zbMATH OpenOpenAlexFDO

Authors Carlos Correa, Ivan Marsic, Xiaodong Sun

Publication date 17 January 2006

Published in JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10852-005-0855-4

zbMATH Keywords

dynamic programmingstructured data simplificationvirtual worlds

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04) Boolean programming (90C09) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• An Iterative Heuristic Algorithm for Tree Decomposition
• Branching and Treewidth Based Exact Algorithms
• Dynamic tree algorithms
• On Exact Algorithms for Treewidth
• Dynamic algorithms for graphs of bounded treewidth

Cites work

• A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem
• Heuristic and exact algorithms for the precedence-constrained knapsack problem
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1769298 (Why is no real title available?)
• On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees

Cited in

(4)

• Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm
• An Iterative Heuristic Algorithm for Tree Decomposition
• A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem
• scientific article; zbMATH DE number 1769298 (Why is no real title available?)

This page was built for publication: Exact and heuristic algorithms for dynamic tree simplification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2583510)