The following pages link to (Q3128917):
Displayed 7 items.
- An O\((\log k)\)-approximation algorithm for the \(k\) minimum spanning tree problem in the plane (Q679454) (← links)
- Low-light trees, and tight lower bounds for Euclidean spanners (Q972609) (← links)
- Approximating the weight of shallow Steiner trees (Q1296580) (← links)
- A constant-factor approximation algorithm for the \(k\)-MST problem (Q1305925) (← links)
- \(k\)-edge subgraph problems (Q1356515) (← links)
- Faster geometric \(k\)-point MST approximation (Q1370933) (← links)
- On the approximability of some Maximum Spanning Tree Problems (Q1391300) (← links)