Abstract
We consider the Maximum Weight Independent Set problem, with a focus on obtaining good approximations for graphs of small maximum degree Δ. We give deterministic local algorithms running in time poly(Δ,logn) that come close to matching the best centralized results known and improve the previous distributed approximations by a factor of about 2. More precisely, we obtain approximations below Δ+1/22, and a further improvement to 8/5+ε when Δ=3. Technically, this is achieved by leveraging the fractional local ratio technique, for a first application in a distributed setting.
| Original language | English |
|---|---|
| Title of host publication | Structural Information and Communication Complexity - 31st International Colloquium, SIROCCO 2024, Proceedings |
| Editors | Yuval Emek |
| Publisher | Springer Science and Business Media Deutschland GmbH |
| Pages | 281-299 |
| Number of pages | 19 |
| ISBN (Print) | 9783031606021 |
| State | Published - 2024 |
| Event | 31st International Colloquium on Structural Information and Communication Complexity, SIROCCO 2024 - Vietri sul Mare, Italy Duration: 27 May 2024 → 29 May 2024 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 14662 LNCS |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Conference
| Conference | 31st International Colloquium on Structural Information and Communication Complexity, SIROCCO 2024 |
|---|---|
| Country/Territory | Italy |
| City | Vietri sul Mare |
| Period | 27/05/24 → 29/05/24 |
Bibliographical note
Publisher Copyright:© The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.