Pages that link to "Item:Q846011"
From MaRDI portal
The following pages link to Lower bounds for testing Euclidean minimum spanning trees (Q846011):
Displaying 7 items.
- A stronger lower bound on parametric minimum spanning trees (Q832875) (← links)
- Approximating \(k\)-hop minimum spanning trees in Euclidean metrics (Q963410) (← links)
- Dynamic Euclidean minimum spanning trees and extrema of binary functions (Q1346130) (← links)
- The realization problem for Euclidean minimum spanning trees is NP-hard (Q1920421) (← links)
- Time-space trade-offs for computing Euclidean minimum spanning trees (Q2294682) (← links)
- Testing Euclidean Spanners (Q3586451) (← links)
- Testing Euclidean minimum spanning trees in the plane (Q4962736) (← links)