The following pages link to (Q4234076):
Displaying 8 items.
- A 2.5-factor approximation algorithm for the \(k\)-MST problem (Q293204) (← links)
- An O\((\log k)\)-approximation algorithm for the \(k\) minimum spanning tree problem in the plane (Q679454) (← links)
- An improved approximation ratio for the minimum latency problem (Q1290636) (← links)
- A constant-factor approximation algorithm for the \(k\)-MST problem (Q1305925) (← links)
- Faster geometric \(k\)-point MST approximation (Q1370933) (← links)
- Compact location problems (Q1391322) (← links)
- Local search algorithms for the \(k\)-cardinality tree problem. (Q1811129) (← links)
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints (Q2492210) (← links)
