Brief Announcement: Simple and Local Independent Set Approximation

PODC '18: ACM Symposium on Principles of Distributed Computing Egham United Kingdom July, 2018, pp. 163-165, 2018.

Cited by: 0|Views19


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 i...More



Get fulltext within 24h
Upload PDF

1.Your uploaded documents will be check within 24h, and coins will be credited to your account.

2.As the current system does not support cash withdrawal, you can add staff WeChat (AMxiaomai) to receive it as a red packet.

3.10 coins will be exchanged for 1 yuan.


Upload a single paper

for 5 coins

Wechat's Red Packet

Upload 50 articles

for 280 coins

Wechat's Red Packet

Upload 200 articles

for 1200 coins

Wechat's Red Packet

Upload 500 articles

for 3000 coins

Wechat's Red Packet

Upload 1000 articles

for 7000 coins

Wechat's Red Packet
Your rating :