Revisiting dynamic programming for finding optimal subtrees in trees
From MaRDI portal
Publication:856203
DOI10.1016/J.EJOR.2005.11.005zbMATH Open1111.90093OpenAlexW2083042895MaRDI QIDQ856203FDOQ856203
Publication date: 7 December 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.11.005
Recommendations
- Optimizing constrained subtrees of trees
- An optimal algorithm for computing all subtree repeats in trees
- An optimal algorithm for computing all subtree repeats in trees
- Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
- The Fine Details of Fast Dynamic Programming over Tree Decompositions
- Optimal Search in Trees
- scientific article; zbMATH DE number 1135820
- scientific article; zbMATH DE number 5237331
- Dynamic programming and planarity: improved tree-decomposition based algorithms
- A dynamic programming algorithm for the tree mapping problem
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Dynamic programming (90C39)
Cites Work
- \(K\)-tree/\(K\)-subgraph: A program package for minimal weighted \(K\)-cardinlity trees and subgraphs
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Title not available (Why is that?)
- Introduction to algorithms
- Local search algorithms for the \(k\)-cardinality tree problem.
- Decomposing Matrices into Blocks
- Variable neighborhood decomposition search for the edge weighted \(k\)-cardinality tree problem
- Spanning Trees—Short or Small
- An O\((\log k)\)-approximation algorithm for the \(k\) minimum spanning tree problem in the plane
- New metaheuristic approaches for the edge-weighted \(k\)-cardinality tree problem
- Weighted k‐cardinality trees: Complexity and polyhedral structure
- Title not available (Why is that?)
- Title not available (Why is that?)
- Integer programming approaches to facilities layout models with forbidden areas
Cited In (11)
- The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation
- An Analysis of a Good Algorithm for the Subtree Problem, Corrected
- Dynamic programming and planarity: improved tree-decomposition based algorithms
- Positive-instance driven dynamic programming for treewidth
- Title not available (Why is that?)
- DynASP2.5: Dynamic Programming on Tree Decompositions in Action
- The Fine Details of Fast Dynamic Programming over Tree Decompositions
- An improved algorithm for finding a length-constrained maximum-density subtree in a tree
- Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems
- Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem
- Weighted target set selection on trees and cycles
Uses Software
This page was built for publication: Revisiting dynamic programming for finding optimal subtrees in trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856203)
