We show that the first phase of the Linial-Saks network decomposition algorithm gives a randomized distributed O(nε)-approximation algorithm for the maximum ...
Local Algorithms. A central question in distributed computing is what can be computed locally, i.e., in. O(1) communication rounds. Local algorithms have ...
Missing: Simple | Show results with:Simple
Dec 18, 2020 · We study the worst-case behavior of Turán-like bounds for unweighted and weighted independent sets in bounded-degree graphs.
We examine here the minimal requirements for computing non-trivial independent sets. In particular, we focus on algorithms that operate in a single ...
Mar 2, 2018 · We bound the performance guarantees that follow from Turán-like bounds for unweighted and weighted independent sets in bounded-degree graphs.
Missing: Announcement: | Show results with:Announcement:
ABSTRACT. We bound the performance guarantees that follow from Turán-like bounds for unweighted and weighted independent sets in bounded- degree graphs.
Mar 2, 2018 · Brief announcement: Local independent set approximation. In PODC, New York, NY, USA, 2016. ACM. [8] R. B. Boppana. Personal communication to ...
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 ...
Abstract. We bound the performance guarantees that follow from. Turán-like bounds for unweighted and weighted independent sets in bounded-degree graphs.
We bound the performance guarantees that follow from Turán-like bounds for unweighted and weighted independent sets in bounded-degree graphs.