@inproceedings{2a64ba0ef0884a86b104b5502f0f1012,
title = "Brief announcement: 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.",
keywords = "Approximation algorithm, Distributed algorithm, Independent set, Tur{\'a}n bound",
author = "Boppana, {Ravi B.} and Halld{\'o}rsson, {Magn{\'u}s M.} and Dror Rawitz",
note = "Publisher Copyright: {\textcopyright} 2018 Copyright held by the owner/author(s).; 37th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2018 ; Conference date: 23-07-2018 Through 27-07-2018",
year = "2018",
month = jul,
day = "23",
doi = "https://doi.org/10.1145/3212734.3212793",
language = "الإنجليزيّة",
isbn = "9781450357951",
series = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",
pages = "163--165",
booktitle = "PODC 2018 - Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing",
}