Pages that link to "Item:Q1305925"
From MaRDI portal
The following pages link to A constant-factor approximation algorithm for the \(k\)-MST problem (Q1305925):
Displayed 4 items.
- Local search algorithms for the \(k\)-cardinality tree problem. (Q1811129) (← 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)
- A Constant Factor Approximation for Minimum λ-Edge-Connected k-Subgraph with Metric Costs (Q5900474) (← links)