Streaming Euclidean Max-Cut: Dimension vs Data Reduction

by   Yu Chen, et al.

Max-Cut is a fundamental problem that has been studied extensively in various settings. We study Euclidean Max-Cut, where the input is a set of points in ℝ^d, in the model of dynamic geometric streams, that is, the input is X⊆ [Δ]^d presented as a sequence of point insertions and deletions. Previous results by Frahling and Sohler [STOC'05] only address the low-dimensional regime, as their (1+ϵ)-approximation algorithm uses space exp(d). We design the first streaming algorithms that use space poly(d), and are thus suitable for a high dimension d. We tackle this challenge of high dimension using two well-known approaches. The first one is via dimension reduction, where we show that target dimension poly(ϵ^-1) suffices for the Johnson-Lindenstrauss transform to preserve Max-Cut within factor (1 ±ϵ). This result extends the applicability of the prior work (algorithm with exp(d)-space) also to high dimension. The second approach is data reduction, based on importance sampling. We implement this scheme in streaming by employing a randomly-shifted quadtree. While this is a well-known method to construct a tree embedding, a key feature of our algorithm is that the distortion O(dlogΔ) affects only the space requirement poly(ϵ^-1 dlogΔ), and not the approximation ratio 1+ϵ. These results are in line with the growing interest and recent results on streaming (and other) algorithms for high dimension.


page 1

page 2

page 3

page 4


Streaming Facility Location in High Dimension via New Geometric Hashing

In Euclidean Uniform Facility Location, the input is a set of clients in...

Streaming Algorithms for Geometric Steiner Forest

We consider a natural generalization of the Steiner tree problem, the St...

Optimal Streaming Approximations for all Boolean Max-2CSPs

We prove tight upper and lower bounds on approximation ratios of all Boo...

Streaming Balanced Clustering

Clustering of data points in metric space is among the most fundamental ...

Approximating Max-Cut on Bounded Degree Graphs: Tighter Analysis of the FKL Algorithm

In this note, we describe a α_GW + Ω̃(1/d^2)-factor approximation algori...

High-Dimensional Geometric Streaming in Polynomial Space

Many existing algorithms for streaming geometric data analysis have been...

Max filtering with reflection groups

Given a finite-dimensional real inner product space V and a finite subgr...

Please sign up or login with your details

Forgot password? Click here to reset