Streaming Euclidean MST to a Constant Factor

12/13/2022
by   Vincent Cohen-Addad, et al.
0

We study streaming algorithms for the fundamental geometric problem of computing the cost of the Euclidean Minimum Spanning Tree (MST) on an n-point set X ⊂ℝ^d. In the streaming model, the points in X can be added and removed arbitrarily, and the goal is to maintain an approximation in small space. In low dimensions, (1+ϵ) approximations are possible in sublinear space [Frahling, Indyk, Sohler, SoCG '05]. However, for high dimensional spaces the best known approximation for this problem was Õ(log n), due to [Chen, Jayaram, Levi, Waingarten, STOC '22], improving on the prior O(log^2 n) bound due to [Indyk, STOC '04] and [Andoni, Indyk, Krauthgamer, SODA '08]. In this paper, we break the logarithmic barrier, and give the first constant factor sublinear space approximation to Euclidean MST. For any ϵ≥ 1, our algorithm achieves an Õ(ϵ^-2) approximation in n^O(ϵ) space. We complement this by proving that any single pass algorithm which obtains a better than 1.10-approximation must use Ω(√(n)) space, demonstrating that (1+ϵ) approximations are not possible in high-dimensions, and that our algorithm is tight up to a constant. Nevertheless, we demonstrate that (1+ϵ) approximations are possible in sublinear space with O(1/ϵ) passes over the stream. More generally, for any α≥ 2, we give a α-pass streaming algorithm which achieves a (1+O(logα + 1/αϵ)) approximation in n^O(ϵ) d^O(1) space. Our streaming algorithms are linear sketches, and therefore extend to the massively-parallel computation model (MPC). Thus, our results imply the first (1+ϵ)-approximation to Euclidean MST in a constant number of rounds in the MPC model.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/05/2021

New Streaming Algorithms for High Dimensional EMD and MST

We study streaming algorithms for two fundamental geometric problems: co...
research
08/01/2023

Massively Parallel Algorithms for High-Dimensional Euclidean Minimum Spanning Tree

We study the classic Euclidean Minimum Spanning Tree (MST) problem in th...
research
11/09/2020

Streaming Algorithms for Geometric Steiner Forest

We consider a natural generalization of the Steiner tree problem, the St...
research
09/08/2021

Adversarially Robust Streaming via Dense–Sparse Trade-offs

A streaming algorithm is adversarially robust if it is guaranteed to per...
research
03/28/2022

Sublinear Algorithms and Lower Bounds for Estimating MST and TSP Cost in General Metrics

We consider the design of sublinear space and query complexity algorithm...
research
04/05/2022

Streaming Facility Location in High Dimension via New Geometric Hashing

In Euclidean Uniform Facility Location, the input is a set of clients in...
research
12/12/2018

Improved Topological Approximations by Digitization

Čech complexes are useful simplicial complexes for computing and analyzi...

Please sign up or login with your details

Forgot password? Click here to reset