Pages that link to "Item:Q1914069"
From MaRDI portal
The following pages link to Optimizing constrained subtrees of trees (Q1914069):
Displaying 17 items.
- Optimization problems in multiple subtree graphs (Q531599) (← links)
- Extended formulations for the cardinality constrained subtree of a tree problem (Q833578) (← links)
- The linking set problem: a polynomial special case of the multiple-choice knapsack problem (Q844527) (← links)
- Revisiting dynamic programming for finding optimal subtrees in trees (Q856203) (← links)
- An improved algorithm for finding a length-constrained maximum-density subtree in a tree (Q975556) (← links)
- Packing and covering a tree by subtrees (Q1101129) (← links)
- Fully polynomial approximation schemes for locating a tree-shaped facility: A generalization of the knapsack problem (Q1270784) (← links)
- An efficient algorithm for a capacitated subtree of a tree problem in local access telecommunication networks (Q1370664) (← links)
- Upper and lower bounding procedures for minimum rooted \(k\)-subtree problem (Q1577113) (← links)
- Optimizing constrained subtrees of trees (Q1914069) (← links)
- Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem (Q2217463) (← links)
- Pruning of CRT-sub-trees (Q2258835) (← links)
- Finding optimal satisficing strategies for and-or trees (Q2457646) (← links)
- Finding a Maximum-Weight Convex Set in a Chordal Graph (Q3121516) (← links)
- Vector optimization of decompositions of root trees (Q3979851) (← links)
- Bounded-degree rooted tree and TDI-ness (Q5104597) (← links)
- The Optimization of Signed Trees (Q5869439) (← links)
