Distributed approximation algorithms for k-dominating set in graphs of bounded genus and linklessly embeddable graphs Regular Submission

Andrzej Czygrinow, Michał Hańckowiak, Wojciech Wawrzyniak, Marcin Witkowski

Research output: Contribution to journalArticle

Abstract

A k-dominating set in a graph G = (V,E) is a set U ¢ V such that ever vertex of G is either in U or has at least k neighbors in U. In this paper we give simple distributed approximation algorithms in the local model for the minimum k-dominating set problem for k ≥ 2 in graphs with no K3,h-minor and graphs with no K4,4-minor. In particular, this gives fast distributed approximations for graphs of bounded genus and linklessly embeddable graphs. The algorithms give a constant approximation ratio and run in a constant number of rounds. In addition, we will give a (1 + €)-Approximation for an arbitrary fixed € > 0 which runs in O(log∗ n) rounds where n is the order of a graph.

Original languageEnglish (US)
Pages (from-to)75-86
Number of pages12
JournalCEUR Workshop Proceedings
Volume1949
StatePublished - 2017
Externally publishedYes

Fingerprint

Approximation algorithms
Parallel algorithms

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Distributed approximation algorithms for k-dominating set in graphs of bounded genus and linklessly embeddable graphs Regular Submission. / Czygrinow, Andrzej; Hańckowiak, Michał; Wawrzyniak, Wojciech; Witkowski, Marcin.

In: CEUR Workshop Proceedings, Vol. 1949, 2017, p. 75-86.

Research output: Contribution to journalArticle

@article{4cbe8527622f4993a73edf01e9a55ac9,
title = "Distributed approximation algorithms for k-dominating set in graphs of bounded genus and linklessly embeddable graphs Regular Submission",
abstract = "A k-dominating set in a graph G = (V,E) is a set U ¢ V such that ever vertex of G is either in U or has at least k neighbors in U. In this paper we give simple distributed approximation algorithms in the local model for the minimum k-dominating set problem for k ≥ 2 in graphs with no K3,h-minor and graphs with no K4,4-minor. In particular, this gives fast distributed approximations for graphs of bounded genus and linklessly embeddable graphs. The algorithms give a constant approximation ratio and run in a constant number of rounds. In addition, we will give a (1 + €)-Approximation for an arbitrary fixed € > 0 which runs in O(log∗ n) rounds where n is the order of a graph.",
author = "Andrzej Czygrinow and Michał Hańckowiak and Wojciech Wawrzyniak and Marcin Witkowski",
year = "2017",
language = "English (US)",
volume = "1949",
pages = "75--86",
journal = "CEUR Workshop Proceedings",
issn = "1613-0073",
publisher = "CEUR-WS",

}

TY - JOUR

T1 - Distributed approximation algorithms for k-dominating set in graphs of bounded genus and linklessly embeddable graphs Regular Submission

AU - Czygrinow, Andrzej

AU - Hańckowiak, Michał

AU - Wawrzyniak, Wojciech

AU - Witkowski, Marcin

PY - 2017

Y1 - 2017

N2 - A k-dominating set in a graph G = (V,E) is a set U ¢ V such that ever vertex of G is either in U or has at least k neighbors in U. In this paper we give simple distributed approximation algorithms in the local model for the minimum k-dominating set problem for k ≥ 2 in graphs with no K3,h-minor and graphs with no K4,4-minor. In particular, this gives fast distributed approximations for graphs of bounded genus and linklessly embeddable graphs. The algorithms give a constant approximation ratio and run in a constant number of rounds. In addition, we will give a (1 + €)-Approximation for an arbitrary fixed € > 0 which runs in O(log∗ n) rounds where n is the order of a graph.

AB - A k-dominating set in a graph G = (V,E) is a set U ¢ V such that ever vertex of G is either in U or has at least k neighbors in U. In this paper we give simple distributed approximation algorithms in the local model for the minimum k-dominating set problem for k ≥ 2 in graphs with no K3,h-minor and graphs with no K4,4-minor. In particular, this gives fast distributed approximations for graphs of bounded genus and linklessly embeddable graphs. The algorithms give a constant approximation ratio and run in a constant number of rounds. In addition, we will give a (1 + €)-Approximation for an arbitrary fixed € > 0 which runs in O(log∗ n) rounds where n is the order of a graph.

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

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

M3 - Article

AN - SCOPUS:85031940846

VL - 1949

SP - 75

EP - 86

JO - CEUR Workshop Proceedings

JF - CEUR Workshop Proceedings

SN - 1613-0073

ER -