Brief announcement: Simple and local independent set approximation

Ravi B. Boppana; Magnús M. Halldórsson; Dror Rawitz

doi:10.1145/3212734.3212793

Brief announcement: Simple and local independent set approximation

Ravi B. Boppana
, Magnús M. Halldórsson
, Dror Rawitz

Bar-Ilan University - The Alexander Kofkin Faculty of Engineering

Massachusetts Institute of Technology
Reykjavík University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

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 (∆+1)-approximation, but a simple modification results in an asymptotic expected 0.529(∆ + 1)-approximation.

Original language	English
Title of host publication	PODC 2018 - Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing
Publisher	Association for Computing Machinery
Pages	163-165
Number of pages	3
ISBN (Print)	9781450357951
DOIs	https://doi.org/10.1145/3212734.3212793
State	Published - 23 Jul 2018
Event	37th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2018 - Egham, United Kingdom Duration: 23 Jul 2018 → 27 Jul 2018

Publication series

Name	Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Conference

Conference	37th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2018
Country/Territory	United Kingdom
City	Egham
Period	23/07/18 → 27/07/18

Bibliographical note

Publisher Copyright:
© 2018 Copyright held by the owner/author(s).

Keywords

Approximation algorithm
Distributed algorithm
Independent set
Turán bound

Access to Document

10.1145/3212734.3212793

Cite this

Boppana, R. B., Halldórsson, M. M., & Rawitz, D. (2018). Brief announcement: Simple and local independent set approximation. In PODC 2018 - Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing (pp. 163-165). (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing). Association for Computing Machinery. https://doi.org/10.1145/3212734.3212793

@inproceedings{69fd4c3ff1e94885826d8e13206af817,

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 = "10.1145/3212734.3212793",

language = "אנגלית",

isbn = "9781450357951",

series = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",

publisher = "Association for Computing Machinery",

pages = "163--165",

booktitle = "PODC 2018 - Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing",

}

Boppana, RB, Halldórsson, MM & Rawitz, D 2018, Brief announcement: Simple and local independent set approximation. in PODC 2018 - Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing. Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, pp. 163-165, 37th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2018, Egham, United Kingdom, 23/07/18. https://doi.org/10.1145/3212734.3212793

Brief announcement: Simple and local independent set approximation. / Boppana, Ravi B.; Halldórsson, Magnús M.; Rawitz, Dror.
PODC 2018 - Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, 2018. p. 163-165 (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Brief announcement

T2 - 37th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2018

AU - Boppana, Ravi B.

AU - Halldórsson, Magnús M.

AU - Rawitz, Dror

PY - 2018/7/23

Y1 - 2018/7/23

N2 - 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 (∆+1)-approximation, but a simple modification results in an asymptotic expected 0.529(∆ + 1)-approximation.

AB - 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 (∆+1)-approximation, but a simple modification results in an asymptotic expected 0.529(∆ + 1)-approximation.

KW - Approximation algorithm

KW - Distributed algorithm

KW - Independent set

KW - Turán bound

UR - https://www.scopus.com/pages/publications/85052455156

U2 - 10.1145/3212734.3212793

DO - 10.1145/3212734.3212793

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85052455156

SN - 9781450357951

T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

SP - 163

EP - 165

BT - PODC 2018 - Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing

PB - Association for Computing Machinery

Y2 - 23 July 2018 through 27 July 2018

ER -

Brief announcement: Simple and local independent set approximation

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this