Improved Bound for Matching in Random-Order Streams

05/01/2020
by   Aaron Bernstein, et al.
0

We study the problem of computing an approximate maximum cardinality matching in the semi-streaming model when edges arrive in a random order. In the semi-streaming model, the edges of the input graph G = (V,E) are given as a stream e_1, ..., e_m, and the algorithm is allowed to make a single pass over this stream while using O(n polylog(n)) space (m = |E| and n = |V|). If the order of edges is adversarial, a simple single-pass greedy algorithm yields a 1/2-approximation in O(n) space; achieving a better approximation in adversarial streams remains an elusive open question. A line of recent work shows that one can improve upon the 1/2-approximation if the edges of the stream arrive in a random order. The state of the art for this model is two-fold: Assadi et al. [SODA 2019] show how to compute a 2/3(∼.66)-approximate matching, but the space requirement is O(n^1.5polylog(n)). Very recently, Farhadi et al. [SODA 2020] presented an algorithm with the desired space usage of O(n polylog(n)), but a worse approximation ratio of 6/11(∼.545), or 3/5(=.6) in bipartite graphs. In this paper, we present an algorithm that computes a 2/3(∼.66)-approximate matching using only O(n log(n)) space, improving upon both results above. We also note that for adversarial streams, a lower bound of Kapralov [SODA 2013] shows that any algorithm that achieves a 1-1/e(∼.63)-approximation requires (n^1+Ω(1/loglog(n))) space. Our result for random-order streams is the first to go beyond the adversarial-order lower bound, thus establishing that computing a maximum matching is provably easier in random-order streams.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/22/2019

Approximate Maximum Matching in Random Streams

In this paper, we study the problem of finding a maximum matching in the...
research
02/13/2021

Beating Two-Thirds For Random-Order Streaming Matching

We study the maximum matching problem in the random-order semi-streaming...
research
03/29/2020

How the Degeneracy Helps for Triangle Counting in Graph Streams

We revisit the well-studied problem of triangle count estimation in grap...
research
11/26/2017

Online Facility Location on Semi-Random Streams

In the streaming model, the order of the stream can significantly affect...
research
12/20/2018

Temporal Matching

A link stream is a sequence of pairs of the form (t,{u,v}), where t∈ N r...
research
11/20/2019

Online Spectral Approximation in Random Order Streams

This paper studies spectral approximation for a positive semidefinite ma...
research
08/19/2022

Revisiting Maximum Satisfiability and Related Problems in Data Streams

We revisit the MaxSAT problem in the data stream model. In this problem,...

Please sign up or login with your details

Forgot password? Click here to reset