The following pages link to Spanning Trees—Short or Small (Q4881285):
Displayed 15 items.
- Revisiting dynamic programming for finding optimal subtrees in trees (Q856203) (← links)
- Budget constrained minimum cost connected medians (Q876728) (← links)
- On \(k\)-Max-optimization (Q1002079) (← links)
- Compact location problems (Q1391322) (← links)
- The complexity of minimizing certain cost metrics for \(k\)-source spanning trees. (Q1408818) (← links)
- Multi-source spanning trees: Algorithms for minimizing source eccentricities. (Q1427201) (← links)
- New metaheuristic approaches for the edge-weighted \(k\)-cardinality tree problem (Q1764754) (← links)
- The computational complexity of the \(k\)-minimum spanning tree problem in graded matrices (Q1806599) (← links)
- Local search algorithms for the \(k\)-cardinality tree problem. (Q1811129) (← links)
- The non-approximability of bicriteria network design problems (Q1827279) (← links)
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints (Q2492210) (← links)
- A \(2+\varepsilon\) approximation algorithm for the \(k\)-MST problem (Q2492706) (← links)
- Differential approximation of NP-hard problems with equal size feasible solutions (Q4457890) (← links)
- Approximation algorithms for the covering Steiner problem (Q4537631) (← links)
- A Constant Factor Approximation for Minimum λ-Edge-Connected k-Subgraph with Metric Costs (Q5900474) (← links)