Revisiting dynamic programming for finding optimal subtrees in trees
type: Item
instance of: scholarly article
title: Revisiting dynamic programming for finding optimal subtrees in trees
zbMATH Open document ID: 1111.90093
author: Christian Blum
published in: European Journal of Operational Research
publication date: 2006-12-07T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5078470
zbMATH Keywords: heuristics
zbMATH Keywords: dynamic programming
zbMATH Keywords: combinatorial optimization
describes a project that uses: K_TREE/K_SUBGRAPH
MaRDI profile type: Publication
full work available at URL: j.ejor.2005.11.005
OpenAlex ID: W2083042895
cites work: Q4368722
cites work: New metaheuristic approaches for the edge-weighted \(k\)-cardinality tree problem
cites work: Local search algorithms for the \(k\)-cardinality tree problem.
cites work: Decomposing Matrices into Blocks
cites work: Introduction to algorithms
cites work: \(K\)-tree/\(K\)-subgraph: A program package for minimal weighted \(K\)-cardinlity trees and subgraphs
cites work: Q4208337
cites work: Weighted k‐cardinality trees: Complexity and polyhedral structure
cites work: Integer programming approaches to facilities layout models with forbidden areas
cites work: An O\((\log k)\)-approximation algorithm for the \(k\) minimum spanning tree problem in the plane
cites work: Q4216482
cites work: On the shortest spanning subtree of a graph and the traveling salesman problem
cites work: Spanning Trees—Short or Small
cites work: Variable neighborhood decomposition search for the edge weighted \(k\)-cardinality tree problem
DOI: 10.1016/J.EJOR.2005.11.005
Recommended article: Optimizing constrained subtrees of trees
Recommended article: An Optimal Algorithm for Computing All Subtree Repeats in Trees
Recommended article: An optimal algorithm for computing all subtree repeats in trees
Recommended article: Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
Recommended article: The Fine Details of Fast Dynamic Programming over Tree Decompositions
Recommended article: Optimal Search in Trees
Recommended article: Q4381299
Recommended article: Q5443270
Recommended article: Dynamic programming and planarity: improved tree-decomposition based algorithms
Recommended article: A dynamic programming algorithm for the tree mapping problem
description: scientific article; zbMATH DE number 5078470