Pages that link to "Item:Q2817634"
From MaRDI portal
The following pages link to An \(O(\log k)\) approximation algorithm for the \(k\) minimum spanning tree problem in the plane (Q2817634):
Displaying 5 items.
- An O\((\log k)\)-approximation algorithm for the \(k\) minimum spanning tree problem in the plane (Q679454) (← links)
- \(k\)-edge subgraph problems (Q1356515) (← links)
- Faster geometric \(k\)-point MST approximation (Q1370933) (← links)
- Compact location problems (Q1391322) (← links)
- A note on “A linear‐size zero‐one programming model for the minimum spanning tree problem in planar graphs” (Q4628047) (← links)