Distributed domination on sparse graph classes

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F25%3A10515240" target="_blank" >RIV/00216208:11320/25:10515240 - isvavai.cz</a>

Result on the web

<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=lZDy.otR2j" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=lZDy.otR2j</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.ejc.2023.103773" target="_blank" >10.1016/j.ejc.2023.103773</a>

Result language

angličtina

Original language name

Distributed domination on sparse graph classes

Original language description

We show that the dominating set problem admits a constant factor approximation in a constant number of rounds in the LOCAL model of distributed computing on graph classes with bounded expansion. This generalizes a result of Czygrinow et al. for graphs with excluded topological minors to very general classes of uniformly sparse graphs. We demonstrate how our general algorithm can be modified and fine-tuned to compute an (11+ɛ)-approximation (for any ɛ&gt;0) of a minimum dominating set on planar graphs. This improves on the previously best known approximation factor of 52 on planar graphs, which was achieved by an elegant and simple algorithm of Lenzen et al.

Czech name

—

Czech description

—

Type

J_imp - Article in a specialist periodical, which is included in the Web of Science database

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

—

Continuities

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year

2025

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

European Journal of Combinatorics

ISSN

0195-6698

e-ISSN

1095-9971

Volume of the periodical

123

Issue of the periodical within the volume

January 2025

Country of publishing house

GB - UNITED KINGDOM

Number of pages

29

Pages from-to

103773

UT code for WoS article

001313997900001

EID of the result in the Scopus database

2-s2.0-85169878404