Pages that link to "Item:Q293204"
From MaRDI portal
The following pages link to A 2.5-factor approximation algorithm for the \(k\)-MST problem (Q293204):
Displayed 9 items.
- Shape rectangularization problems in intensity-modulated radiation therapy (Q534786) (← links)
- Algorithms for the on-line quota traveling salesman problem (Q834904) (← links)
- A 5-approximation algorithm for the \(k\)-prize-collecting Steiner tree problem (Q2421447) (← 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)
- Approximation algorithms for the covering Steiner problem (Q4537631) (← links)
- Prize-Collecting TSP with a Budget Constraint (Q5111751) (← links)
- Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems (Q5119847) (← links)
- A 2-approximation for the \(k\)-prize-collecting Steiner tree problem (Q5970779) (← links)