License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ISAAC.2018.22
URN: urn:nbn:de:0030-drops-99705
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/9970/
Go to the corresponding LIPIcs Volume Portal

Czygrinow, Andrzej ; Hanckowiak, Michal ; Wawrzyniak, Wojciech ; Witkowski, Marcin

Distributed Approximation Algorithms for the Minimum Dominating Set in K_h-Minor-Free Graphs

pdf-format:
LIPIcs-ISAAC-2018-22.pdf (0.4 MB)

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(gamma(G)) in a graph G which has no topological copy of K_h. The algorithm runs L_h rounds where L_h is a constant which depends on h only. This procedure can be used to obtain a distributed algorithm which given epsilon>0 finds in a graph G with no K_h-minor a dominating set D of size at most (1+epsilon)gamma(G). The second algorithm runs in O(log^*{|V(G)|}) rounds.

BibTeX - Entry

@InProceedings{czygrinow_et_al:LIPIcs:2018:9970,
  author =	{Andrzej Czygrinow and Michal Hanckowiak and Wojciech Wawrzyniak and Marcin Witkowski},
  title =	{{Distributed Approximation Algorithms for the Minimum Dominating Set in K_h-Minor-Free Graphs}},
  booktitle =	{29th International Symposium on Algorithms and Computation  (ISAAC 2018)},
  pages =	{22:1--22:12},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-094-1},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{123},
  editor =	{Wen-Lian Hsu and Der-Tsai Lee and Chung-Shou Liao},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/9970},
  URN =		{urn:nbn:de:0030-drops-99705},
  doi =		{10.4230/LIPIcs.ISAAC.2018.22},
  annote =	{Keywords: Distributed algorithms, minor-closed family of graphs, MDS}
}

Keywords: Distributed algorithms, minor-closed family of graphs, MDS
Collection: 29th International Symposium on Algorithms and Computation (ISAAC 2018)
Issue Date: 2018
Date of publication: 06.12.2018

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI