A fast and simple algorithm for computing approximate Euclidean minimum spanning trees
From MaRDI portal
Publication:4575666
Recommendations
Cited in
(11)- scientific article; zbMATH DE number 2079416 (Why is no real title available?)
- Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time
- Parallel algorithms for geometric graph problems
- Approximate geometric MST range queries
- Computing hierarchies of clusters from the Euclidean minimum spanning tree in linear time
- Euclidean minimum spanning trees with independent and dependent geometric uncertainties
- Fast geometric approximation techniques and geometric embedding problems
- Better \(\varepsilon\)-dependencies for offline approximate nearest neighbor search, Euclidean minimum spanning trees, and \(\varepsilon\)-kernels
- On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees
- Testing Euclidean minimum spanning trees in the plane
- Approximating \(k\)-hop minimum spanning trees in Euclidean metrics
This page was built for publication: A fast and simple algorithm for computing approximate Euclidean minimum spanning trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4575666)