Efficient CONGEST Algorithms for the Lovász Local Lemma.

Yannic Maus; Jara Uitto

doi:10.4230/LIPICS.DISC.2021.31

Efficient CONGEST Algorithms for the Lovász Local Lemma.

Publikation: Konferenzbeitrag › Paper › Begutachtung

Abstract

We present a poly log log n time randomized CONGEST algorithm for a natural class of Lovász Local Lemma (LLL) instances on constant degree graphs. This implies, among other things, that there are no LCL problems with randomized complexity between Ω(log n) and poly log log n. Furthermore, we provide extensions to the network decomposition algorithms given in the recent breakthrough by Rozhoň and Ghaffari [STOC2020] and the follow up by Ghaffari, Grunau, and Rozhoň [SODA2021]. In particular, we show how to obtain a large distance separated weak network decomposition with a negligible dependency on the range of unique identifiers.

Originalsprache	englisch
Seiten	31:1-31:19
DOIs	https://doi.org/10.4230/LIPICS.DISC.2021.31
Publikationsstatus	Veröffentlicht - 1 Okt. 2021
Extern publiziert	Ja
Veranstaltung	35th International Symposium on Distributed Computing: DISC 2021 - Virtual, Freiburg, Deutschland Dauer: 4 Okt. 2021 → 8 Okt. 2021

Konferenz

Konferenz	35th International Symposium on Distributed Computing
Land/Gebiet	Deutschland
Ort	Virtual, Freiburg
Zeitraum	4/10/21 → 8/10/21

ASJC Scopus subject areas

Software

Zugriff auf Dokument

10.4230/LIPICS.DISC.2021.31Lizenz: CC BY 4.0

https://dblp.org/rec/conf/wdag/MausU21

Andere Dateien und Links

Verknüpfung zur Publikation in Scopus

Dieses zitieren

@conference{e8fc11702c204914ac6546c48e9efae1,

title = "Efficient CONGEST Algorithms for the Lov{\'a}sz Local Lemma.",

abstract = "We present a poly log log n time randomized CONGEST algorithm for a natural class of Lov{\'a}sz Local Lemma (LLL) instances on constant degree graphs. This implies, among other things, that there are no LCL problems with randomized complexity between Ω(log n) and poly log log n. Furthermore, we provide extensions to the network decomposition algorithms given in the recent breakthrough by Rozho{\v n} and Ghaffari [STOC2020] and the follow up by Ghaffari, Grunau, and Rozho{\v n} [SODA2021]. In particular, we show how to obtain a large distance separated weak network decomposition with a negligible dependency on the range of unique identifiers.",

keywords = "CONGEST, Distributed graph algorithms, Locally checkable labelings, Lov{\'a}sz Local Lemma",

author = "Yannic Maus and Jara Uitto",

year = "2021",

month = oct,

day = "1",

doi = "10.4230/LIPICS.DISC.2021.31",

language = "English",

pages = "31:1--31:19",

note = "35th International Symposium on Distributed Computing : DISC 2021 ; Conference date: 04-10-2021 Through 08-10-2021",

}

TY - CONF

T1 - Efficient CONGEST Algorithms for the Lovász Local Lemma.

AU - Maus, Yannic

AU - Uitto, Jara

PY - 2021/10/1

Y1 - 2021/10/1

N2 - We present a poly log log n time randomized CONGEST algorithm for a natural class of Lovász Local Lemma (LLL) instances on constant degree graphs. This implies, among other things, that there are no LCL problems with randomized complexity between Ω(log n) and poly log log n. Furthermore, we provide extensions to the network decomposition algorithms given in the recent breakthrough by Rozhoň and Ghaffari [STOC2020] and the follow up by Ghaffari, Grunau, and Rozhoň [SODA2021]. In particular, we show how to obtain a large distance separated weak network decomposition with a negligible dependency on the range of unique identifiers.

AB - We present a poly log log n time randomized CONGEST algorithm for a natural class of Lovász Local Lemma (LLL) instances on constant degree graphs. This implies, among other things, that there are no LCL problems with randomized complexity between Ω(log n) and poly log log n. Furthermore, we provide extensions to the network decomposition algorithms given in the recent breakthrough by Rozhoň and Ghaffari [STOC2020] and the follow up by Ghaffari, Grunau, and Rozhoň [SODA2021]. In particular, we show how to obtain a large distance separated weak network decomposition with a negligible dependency on the range of unique identifiers.

KW - CONGEST

KW - Distributed graph algorithms

KW - Locally checkable labelings

KW - Lovász Local Lemma

UR - http://www.scopus.com/inward/record.url?scp=85118156599&partnerID=8YFLogxK

U2 - 10.4230/LIPICS.DISC.2021.31

DO - 10.4230/LIPICS.DISC.2021.31

M3 - Paper

SP - 31:1-31:19

T2 - 35th International Symposium on Distributed Computing

Y2 - 4 October 2021 through 8 October 2021

ER -

Efficient CONGEST Algorithms for the Lovász Local Lemma.

Abstract

Konferenz

ASJC Scopus subject areas

Zugriff auf Dokument

Andere Dateien und Links

Fingerprint

Dieses zitieren