Work

Solving Sequential Greedy Problems Distributedly with Sub-Logarithmic Energy Cost

Year: 2025

Type: conference-paper

Abstract: We study the awake complexity of graph problems that belong to the class O-LOCAL, which includes a subset of problems solvable by sequential greedy algorithms, such as (Δ + 1)-coloring and maximal independent set. It is known from previous work that, in n-node graphs of maximum degree Δ, any problem in the class O-LOCAL can be solved by a deterministic distributed algorithm with awake complexity O (log Δ + log* n).

Source: ACM Symposium on Principles of Distributed Computing (PODC)

DOI: 10.1145/3732772.3733499

Authors: Alkida Balliu, Pierre Fraigniaud, Dennis Olivetti, Mikaël Rabie

Institutions: Gran Sasso Science Institute, Centre National de la Recherche Scientifique, Université Paris Cité, Institut de Recherche en Informatique Fondamentale

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Funders: Agence Nationale de la Recherche, Ministero dell’Istruzione, dell’Università e della Ricerca

Awards: Distributed Network Computing through the Lens of Combinatorial Topology, Energy-Efficient Distributed Computing, G4067119885, G7195575886