Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time
From MaRDI portal
(Redirected from Publication:5700570)
Recommendations
- scientific article; zbMATH DE number 1756011
- Approximating the Minimum Spanning Tree Weight in Sublinear Time
- scientific article; zbMATH DE number 2079416
- Estimating the Weight of Metric Minimum Spanning Trees in Sublinear Time
- Estimating the weight of metric minimum spanning trees in sublinear-time
- A fast and simple algorithm for computing approximate Euclidean minimum spanning trees
- Approximating \(k\)-hop minimum spanning trees in Euclidean metrics
- A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees
Cited in
(25)- A sublinear-time approximation scheme for bin packing
- Dynamic graph stream algorithms in \(o(n)\) space
- Conic nearest neighbor queries and approximate Voronoi diagrams
- Can we locally compute sparse connected subgraphs?
- SAMPLING IN DYNAMIC DATA STREAMS AND APPLICATIONS
- Estimating the Weight of Metric Minimum Spanning Trees in Sublinear Time
- Estimating the weight of metric minimum spanning trees in sublinear-time
- scientific article; zbMATH DE number 2079416 (Why is no real title available?)
- A fast and simple algorithm for computing approximate Euclidean minimum spanning trees
- Approximately counting triangles in sublinear time
- Sublinear-time Algorithms
- Testing Euclidean Spanners
- Sublinear time estimation of degree distribution moments: the arboricity connection
- A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling
- On approximating the number of k-cliques in sublinear time
- Approximate geometric MST range queries
- Separating Sublinear Time Computations by Approximate Diameter
- A near-optimal sublinear-time algorithm for approximating the minimum vertex cover size
- Sublinear time approximation of the cost of a metric k-nearest neighbor graph
- Streaming Euclidean MST to a constant factor
- Sublinear time approximation schemes for makespan minimization on parallel machines
- More dynamic data structures for geometric set cover with sublinear update time
- Lower bounds for testing Euclidean minimum spanning trees
- Separating sublinear time computations by approximate diameter
- Approximating \(k\)-hop minimum spanning trees in Euclidean metrics
This page was built for publication: Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5700570)
