Sublinear Algorithms for MAXCUT and Correlation Clustering

02/20/2018
by   Aditya Bhaskara, et al.
0

We study sublinear algorithms for two fundamental graph problems, MAXCUT and correlation clustering. Our focus is on constructing core-sets as well as developing streaming algorithms for these problems. Constant space algorithms are known for dense graphs for these problems, while Ω(n) lower bounds exist (in the streaming setting) for sparse graphs. Our goal in this paper is to bridge the gap between these extremes. Our first result is to construct core-sets of size Õ(n^1-δ) for both the problems, on graphs with average degree n^δ (for any δ >0). This turns out to be optimal, under the exponential time hypothesis (ETH). Our core-set analysis is based on studying random-induced sub-problems of optimization problems. To the best of our knowledge, all the known results in our parameter range rely crucially on near-regularity assumptions. We avoid these by using a biased sampling approach, which we analyze using recent results on concentration of quadratic functions. We then show that our construction yields a 2-pass streaming (1+ϵ)-approximation for both problems; the algorithm uses Õ(n^1-δ) space, for graphs of average degree n^δ.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/02/2020

Near-Quadratic Lower Bounds for Two-Pass Graph Streaming Algorithms

We prove that any two-pass graph streaming algorithm for the s-t reachab...
research
04/11/2021

Graph Streaming Lower Bounds for Parameter Estimation and Property Testing via a Streaming XOR Lemma

We study space-pass tradeoffs in graph streaming algorithms for paramete...
research
05/26/2023

Sublinear-Space Streaming Algorithms for Estimating Graph Parameters on Sparse Graphs

In this paper, we design sub-linear space streaming algorithms for estim...
research
06/08/2021

A Quantum Advantage for a Natural Streaming Problem

Data streaming, in which a large dataset is received as a "stream" of up...
research
05/18/2021

Vertex Ordering Problems in Directed Graph Streams

We consider directed graph algorithms in a streaming setting, focusing o...
research
07/19/2022

On Regularity Lemma and Barriers in Streaming and Dynamic Matching

We present a new approach for finding matchings in dense graphs by build...
research
07/18/2022

Streaming Algorithms for Support-Aware Histograms

Histograms, i.e., piece-wise constant approximations, are a popular tool...

Please sign up or login with your details

Forgot password? Click here to reset