@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{\l} Han{\'c}kowiak and Wojciech Wawrzyniak and Marcin Witkowski",

year = "2018",

month = dec,

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",

note = "29th International Symposium on Algorithms and Computation, ISAAC 2018 ; Conference date: 16-12-2018 Through 19-12-2018",

}