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

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

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

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 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 > 0 finds in a graph G with no K h -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
EditorsDer-Tsai Lee, Chung-Shou Liao, Wen-Lian Hsu
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
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
CountryTaiwan, Province of China
CityJiaoxi, Yilan
Period12/16/1812/19/18

Fingerprint

Approximation algorithms
Parallel algorithms

Keywords

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

ASJC Scopus subject areas

  • Software

Cite this

Czygrinow, A., Hanćkowiak, M., Wawrzyniak, W., & Witkowski, M. (2018). Distributed approximation algorithms for the minimum dominating set in K H -minor-free graphs In D-T. Lee, C-S. Liao, & W-L. Hsu (Eds.), 29th International Symposium on Algorithms and Computation, ISAAC 2018 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 123). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ISAAC.2018.22

Distributed approximation algorithms for the minimum dominating set in K H -minor-free graphs . / Czygrinow, Andrzej; Hanćkowiak, Michał; Wawrzyniak, Wojciech; Witkowski, Marcin.

29th International Symposium on Algorithms and Computation, ISAAC 2018. ed. / Der-Tsai Lee; Chung-Shou Liao; Wen-Lian Hsu. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2018. (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 123).

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

Czygrinow, A, Hanćkowiak, M, Wawrzyniak, W & Witkowski, M 2018, Distributed approximation algorithms for the minimum dominating set in K H -minor-free graphs in D-T Lee, C-S Liao & W-L Hsu (eds), 29th International Symposium on Algorithms and Computation, ISAAC 2018. Leibniz International Proceedings in Informatics, LIPIcs, vol. 123, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 29th International Symposium on Algorithms and Computation, ISAAC 2018, Jiaoxi, Yilan, Taiwan, Province of China, 12/16/18. https://doi.org/10.4230/LIPIcs.ISAAC.2018.22
Czygrinow A, Hanćkowiak M, Wawrzyniak W, Witkowski M. Distributed approximation algorithms for the minimum dominating set in K H -minor-free graphs In Lee D-T, Liao C-S, Hsu W-L, editors, 29th International Symposium on Algorithms and Computation, ISAAC 2018. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 2018. (Leibniz International Proceedings in Informatics, LIPIcs). https://doi.org/10.4230/LIPIcs.ISAAC.2018.22
Czygrinow, Andrzej ; Hanćkowiak, Michał ; Wawrzyniak, Wojciech ; Witkowski, Marcin. / Distributed approximation algorithms for the minimum dominating set in K H -minor-free graphs 29th International Symposium on Algorithms and Computation, ISAAC 2018. editor / Der-Tsai Lee ; Chung-Shou Liao ; Wen-Lian Hsu. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2018. (Leibniz International Proceedings in Informatics, LIPIcs).
@inproceedings{ef72fb613b734ad59ca311d40927f99d,
title = "Distributed approximation algorithms for the minimum dominating set in K H -minor-free graphs",
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 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 > 0 finds in a graph G with no K h -minor a dominating set D of size at most (1 + )γ(G). The second algorithm runs in O(log ∗ |V (G)|) rounds.",
keywords = "Distributed algorithms, MDS, Minor-closed family of graphs",
author = "Andrzej Czygrinow and Michał Hanćkowiak and Wojciech Wawrzyniak and Marcin Witkowski",
year = "2018",
month = "12",
day = "1",
doi = "10.4230/LIPIcs.ISAAC.2018.22",
language = "English (US)",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Der-Tsai Lee and Chung-Shou Liao and Wen-Lian Hsu",
booktitle = "29th International Symposium on Algorithms and Computation, ISAAC 2018",
address = "Germany",

}

TY - GEN

T1 - Distributed approximation algorithms for the minimum dominating set in K H -minor-free graphs

AU - Czygrinow, Andrzej

AU - Hanćkowiak, Michał

AU - Wawrzyniak, Wojciech

AU - Witkowski, Marcin

PY - 2018/12/1

Y1 - 2018/12/1

N2 - 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 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 > 0 finds in a graph G with no K h -minor a dominating set D of size at most (1 + )γ(G). The second algorithm runs in O(log ∗ |V (G)|) rounds.

AB - 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 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 > 0 finds in a graph G with no K h -minor a dominating set D of size at most (1 + )γ(G). The second algorithm runs in O(log ∗ |V (G)|) rounds.

KW - Distributed algorithms

KW - MDS

KW - Minor-closed family of graphs

UR - http://www.scopus.com/inward/record.url?scp=85063663800&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85063663800&partnerID=8YFLogxK

U2 - 10.4230/LIPIcs.ISAAC.2018.22

DO - 10.4230/LIPIcs.ISAAC.2018.22

M3 - Conference contribution

AN - SCOPUS:85063663800

T3 - Leibniz International Proceedings in Informatics, LIPIcs

BT - 29th International Symposium on Algorithms and Computation, ISAAC 2018

A2 - Lee, Der-Tsai

A2 - Liao, Chung-Shou

A2 - Hsu, Wen-Lian

PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

ER -