Simple and Local Independent Set Approximation
Data Structures and Algorithms
2018-03-05 v1
Abstract
We bound the performance guarantees that follow from Tur\'an-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 -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 -approximation. This compares with a recent, more complex -approximation~\cite{BCGS17}, which holds deterministically.
Cite
@article{arxiv.1803.00786,
title = {Simple and Local Independent Set Approximation},
author = {Ravi B. Boppana and Magnús M. Halldórsson and Dror Rawitz},
journal= {arXiv preprint arXiv:1803.00786},
year = {2018}
}