Simple and Local Independent Set Approximation

03/02/2018
by   Ravi B. Boppana, et al.
0

We bound the performance guarantees that follow from Turán-like bounds for unweighted and weighted independent sets in bounded-degree graphs. In particular, a randomized approach of Boppana forms a simple 1-round distributed algorithm, as well as a streaming and preemptive online algorithm. We show it gives a tight (Δ+1)/2-approximation in unweighted graphs of maximum degree Δ, which is best possible for 1-round distributed algorithms. For weighted graphs, it gives only a Δ-approximation, but a simple modification results in an asymptotic expected 0.529 Δ-approximation. This compares with a recent, more complex Δ-approximation BCGS17, which holds deterministically.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/10/2022

Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs

We describe a simple deterministic O( ε^-1logΔ) round distributed algori...
research
08/17/2022

Fast Distributed Vertex Splitting with Applications

We present polyloglog n-round randomized distributed algorithms to compu...
research
06/27/2019

Improved Distributed Approximation to Maximum Independent Set

We present improved results for approximating Maximum Independent Set ()...
research
02/01/2021

Stochastic Alignment Processes

The tendency to align to others is inherent to social behavior, includin...
research
02/13/2019

Local approximation of the Maximum Cut in regular graphs

This paper is devoted to the distributed complexity of finding an approx...
research
05/05/2021

Local Algorithms for Bounded Degree Sparsifiers in Sparse Graphs

In graph sparsification, the goal has almost always been of global natur...
research
02/19/2018

On Local Distributed Sampling and Counting

In classic distributed graph problems, each instance on a graph specifie...

Please sign up or login with your details

Forgot password? Click here to reset