Brief Announcement: Faster CONGEST Approximation Algorithms for Maximum Weighted Independent Set in Sparse Graphs

Salwa Faour, Fabian Kuhn. Brief Announcement: Faster CONGEST Approximation Algorithms for Maximum Weighted Independent Set in Sparse Graphs. In Dariusz R. Kowalski, editor, 39th International Symposium on Distributed Computing, DISC 2025, October 27-31, 2025, Berlin, Germany. Volume 356 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. [doi]

Abstract

Abstract is missing.