Distributed approximation algorithms for the minimum dominating set in KH-minor-free graphs

Andrzej Czygrinow, Michał Hanćkowiak, Wojciech Wawrzyniak, Marcin Witkowski

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

In this paper we will give two distributed approximation algorithms (in the Local model) for the minimum dominating set problem. First we will give a distributed algorithm which finds a dominating set D of size O(γ(G)) in a graph G which has no topological copy of Kh. The algorithm runs Lh rounds where Lh is a constant which depends on h only. This procedure can be used to obtain a distributed algorithm which given > 0 finds in a graph G with no Kh-minor a dominating set D of size at most (1 + )γ(G). The second algorithm runs in O(log |V (G)|) rounds.

Original languageEnglish (US)
Title of host publication29th International Symposium on Algorithms and Computation, ISAAC 2018
EditorsWen-Lian Hsu, Der-Tsai Lee, Chung-Shou Liao
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Pages22:1–22:12
ISBN (Electronic)9783959770941
DOIs
StatePublished - Dec 1 2018
Event29th International Symposium on Algorithms and Computation, ISAAC 2018 - Jiaoxi, Yilan, Taiwan, Province of China
Duration: Dec 16 2018Dec 19 2018

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume123
ISSN (Print)1868-8969

Conference

Conference29th International Symposium on Algorithms and Computation, ISAAC 2018
Country/TerritoryTaiwan, Province of China
CityJiaoxi, Yilan
Period12/16/1812/19/18

Keywords

  • Distributed algorithms
  • MDS
  • Minor-closed family of graphs

ASJC Scopus subject areas

  • Software

Fingerprint

Dive into the research topics of 'Distributed approximation algorithms for the minimum dominating set in K<sub>H</sub>-minor-free graphs'. Together they form a unique fingerprint.

Cite this