@inproceedings{272766483bd7489bba19bef3d604cd5f,
title = "Simple and local independent set approximation",
abstract = "We bound the performance guarantees that follow from Tur{\'a}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 (Δ + 1)-approximation, but a simple modification results in an asymptotic expected 0.529(Δ + 1)-approximation. This compares with a recent, more complex Δ-approximation [6], which holds determin-istically.",
author = "Boppana, \{Ravi B.\} and Halld{\'o}rsson, \{Magn{\'u}s M.\} and Dror Rawitz",
note = "Publisher Copyright: {\textcopyright} Springer Nature Switzerland AG 2018.; 25th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2018 ; Conference date: 18-06-2018 Through 21-06-2018",
year = "2018",
doi = "10.1007/978-3-030-01325-7\_12",
language = "الإنجليزيّة",
isbn = "9783030013240",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "88--101",
editor = "Zvi Lotker and Boaz Patt-Shamir",
booktitle = "25th International Colloquium, SIROCCO 2018, Revised Selected Papers",
address = "ألمانيا",
}