{"@context":"https:\/\/schema.org\/","@type":"ScholarlyArticle","@id":"#article11874","name":"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(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.","keywords":["Distributed algorithms","minor-closed family of graphs","MDS"],"author":[{"@type":"Person","name":"Czygrinow, Andrzej","givenName":"Andrzej","familyName":"Czygrinow","affiliation":"School of Mathematical and Statistical Sciences, Arizona State University, Tempe, AZ, 85287-1804, USA","funding":"Research supported in part by Simons Foundation Grant # 521777."},{"@type":"Person","name":"Hanckowiak, Michal","givenName":"Michal","familyName":"Hanckowiak","affiliation":"Faculty of Mathematics and Computer Science, Adam Mickiewicz University, Pozna\u0144, Poland"},{"@type":"Person","name":"Wawrzyniak, Wojciech","givenName":"Wojciech","familyName":"Wawrzyniak","affiliation":"Faculty of Mathematics and Computer Science, Adam Mickiewicz University, Pozna\u0144, Poland"},{"@type":"Person","name":"Witkowski, Marcin","givenName":"Marcin","familyName":"Witkowski","affiliation":"Faculty of Mathematics and Computer Science, Adam Mickiewicz University, Pozna\u0144, Poland"}],"position":22,"pageStart":"22:1","pageEnd":"22:12","dateCreated":"2018-12-06","datePublished":"2018-12-06","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Czygrinow, Andrzej","givenName":"Andrzej","familyName":"Czygrinow","affiliation":"School of Mathematical and Statistical Sciences, Arizona State University, Tempe, AZ, 85287-1804, USA","funding":"Research supported in part by Simons Foundation Grant # 521777."},{"@type":"Person","name":"Hanckowiak, Michal","givenName":"Michal","familyName":"Hanckowiak","affiliation":"Faculty of Mathematics and Computer Science, Adam Mickiewicz University, Pozna\u0144, Poland"},{"@type":"Person","name":"Wawrzyniak, Wojciech","givenName":"Wojciech","familyName":"Wawrzyniak","affiliation":"Faculty of Mathematics and Computer Science, Adam Mickiewicz University, Pozna\u0144, Poland"},{"@type":"Person","name":"Witkowski, Marcin","givenName":"Marcin","familyName":"Witkowski","affiliation":"Faculty of Mathematics and Computer Science, Adam Mickiewicz University, Pozna\u0144, Poland"}],"copyrightYear":"2018","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ISAAC.2018.22","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","isPartOf":{"@type":"PublicationVolume","@id":"#volume6326","volumeNumber":123,"name":"29th International Symposium on Algorithms and Computation (ISAAC 2018)","dateCreated":"2018-12-06","datePublished":"2018-12-06","editor":[{"@type":"Person","name":"Hsu, Wen-Lian","givenName":"Wen-Lian","familyName":"Hsu"},{"@type":"Person","name":"Lee, Der-Tsai","givenName":"Der-Tsai","familyName":"Lee"},{"@type":"Person","name":"Liao, Chung-Shou","givenName":"Chung-Shou","familyName":"Liao"}],"isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#article11874","isPartOf":{"@type":"Periodical","@id":"#series116","name":"Leibniz International Proceedings in Informatics","issn":"1868-8969","isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#volume6326"}}}