The following pages link to Spanning Trees—Short or Small (Q4881285):
Displaying 38 items.
- The density maximization problem in graphs (Q386420) (← links)
- Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing (Q848846) (← links)
- Revisiting dynamic programming for finding optimal subtrees in trees (Q856203) (← links)
- Budget constrained minimum cost connected medians (Q876728) (← links)
- The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation (Q987675) (← 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)
- A new approach for the multiobjective minimum spanning tree (Q1651644) (← links)
- New metaheuristic approaches for the edge-weighted \(k\)-cardinality tree problem (Q1764754) (← links)
- A note on the $k$-minimum spanning tree problem on circles (Q1785744) (← 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)
- Integer polynomial recovery from outputs and its application to cryptanalysis of a protocol for secure sorting (Q2079218) (← links)
- Placing Green bridges optimally, with a multivariate analysis (Q2117784) (← links)
- Degree-constrained \(k\)-minimum spanning tree problem (Q2221985) (← links)
- Facility location with tree topology and radial distance constraints (Q2280295) (← links)
- A 4-approximation algorithm for \(k\)-prize collecting Steiner tree problems (Q2414116) (← links)
- A 5-approximation algorithm for the \(k\)-prize-collecting Steiner tree problem (Q2421447) (← links)
- Pruning 2-connected graphs (Q2428662) (← links)
- Euclidean prize-collecting Steiner forest (Q2429324) (← links)
- Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem (Q2434979) (← 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)
- Improved Approximation Algorithms for (Budgeted) Node-weighted Steiner Problems (Q4571047) (← links)
- Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems (Q5210996) (← links)
- A Constant Factor Approximation for Minimum λ-Edge-Connected k-Subgraph with Metric Costs (Q5900474) (← links)
- Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph (Q5963643) (← links)
- A 2-approximation for the \(k\)-prize-collecting Steiner tree problem (Q5970779) (← links)
- Complexity, algorithmic, and computational aspects of a dial-a-ride type problem (Q6113356) (← links)
- A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems (Q6151530) (← links)
- An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth (Q6201339) (← links)
- Simple heuristics for the rooted max tree coverage problem (Q6606188) (← links)
- Placing green bridges optimally, with a multivariate analysis (Q6635698) (← links)
