Distributed local approximation of the minimum k-tuple dominating set in planar graphs

Andrzej Czygrinow, Michal Hanćkowiak, Edyta Szymańska, Wojciech Wawrzyniak, Marcin Witkowski

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

1 Citation (Scopus)

Abstract

In this paper we consider a generalization of the classical dominating set problem to the k-tuple dominating set problem (kMDS). For any positive integer k, we look for a smallest subset of vertices D ⊆ V with the property that every vertex in V\D is adjacent to at least k vertices of D. We are interested in the distributed complexity of this problem in the model, where the nodes have no identifiers. The most challenging case is when k = 2, and for this case we propose a distributed local algorithm, which runs in a constant number of rounds, yielding a 7-approximation in the class of planar graphs. On the other hand, in the class of algorithms in which every vertex uses only its degree and the degree of its neighbors to make decisions, there is no algorithm providing a (5 -ϵ)-approximation of the 2MDS problem. In addition, we show a lower bound of (4 - ϵ) for the 2MDS problem even if unique identifiers are allowed.

For k ≥ 3, we show that for the problem kMDS in planar graphs, a trivial algorithm yields a k/(k - 2)-approximation. In the model with unique identifiers this, surprisingly, is optimal for k = 3, 4, 5, and 6, as we provide a matching lower bound.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages49-59
Number of pages11
Volume8878
ISBN (Print)9783319144719
StatePublished - 2014
Event18th International Conference on Principles of Distributed Systems, OPODIS 2014 - Cortina d’Ampezzo, Italy
Duration: Dec 16 2014Dec 19 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8878
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other18th International Conference on Principles of Distributed Systems, OPODIS 2014
CountryItaly
CityCortina d’Ampezzo
Period12/16/1412/19/14

Fingerprint

Local Approximation
Dominating Set
Planar graph
Approximation
Vertex of a graph
Lower bound
Local Algorithms
Distributed Algorithms
Trivial
Adjacent
Integer
Subset
Model

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Czygrinow, A., Hanćkowiak, M., Szymańska, E., Wawrzyniak, W., & Witkowski, M. (2014). Distributed local approximation of the minimum k-tuple dominating set in planar graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8878, pp. 49-59). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8878). Springer Verlag.

Distributed local approximation of the minimum k-tuple dominating set in planar graphs. / Czygrinow, Andrzej; Hanćkowiak, Michal; Szymańska, Edyta; Wawrzyniak, Wojciech; Witkowski, Marcin.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 8878 Springer Verlag, 2014. p. 49-59 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8878).

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

Czygrinow, A, Hanćkowiak, M, Szymańska, E, Wawrzyniak, W & Witkowski, M 2014, Distributed local approximation of the minimum k-tuple dominating set in planar graphs. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 8878, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8878, Springer Verlag, pp. 49-59, 18th International Conference on Principles of Distributed Systems, OPODIS 2014, Cortina d’Ampezzo, Italy, 12/16/14.
Czygrinow A, Hanćkowiak M, Szymańska E, Wawrzyniak W, Witkowski M. Distributed local approximation of the minimum k-tuple dominating set in planar graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 8878. Springer Verlag. 2014. p. 49-59. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Czygrinow, Andrzej ; Hanćkowiak, Michal ; Szymańska, Edyta ; Wawrzyniak, Wojciech ; Witkowski, Marcin. / Distributed local approximation of the minimum k-tuple dominating set in planar graphs. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 8878 Springer Verlag, 2014. pp. 49-59 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{8bddfbdc6256459e8a8dfec926bfda7b,
title = "Distributed local approximation of the minimum k-tuple dominating set in planar graphs",
abstract = "In this paper we consider a generalization of the classical dominating set problem to the k-tuple dominating set problem (kMDS). For any positive integer k, we look for a smallest subset of vertices D ⊆ V with the property that every vertex in V\D is adjacent to at least k vertices of D. We are interested in the distributed complexity of this problem in the model, where the nodes have no identifiers. The most challenging case is when k = 2, and for this case we propose a distributed local algorithm, which runs in a constant number of rounds, yielding a 7-approximation in the class of planar graphs. On the other hand, in the class of algorithms in which every vertex uses only its degree and the degree of its neighbors to make decisions, there is no algorithm providing a (5 -ϵ)-approximation of the 2MDS problem. In addition, we show a lower bound of (4 - ϵ) for the 2MDS problem even if unique identifiers are allowed.For k ≥ 3, we show that for the problem kMDS in planar graphs, a trivial algorithm yields a k/(k - 2)-approximation. In the model with unique identifiers this, surprisingly, is optimal for k = 3, 4, 5, and 6, as we provide a matching lower bound.",
author = "Andrzej Czygrinow and Michal Hanćkowiak and Edyta Szymańska and Wojciech Wawrzyniak and Marcin Witkowski",
year = "2014",
language = "English (US)",
isbn = "9783319144719",
volume = "8878",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "49--59",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Distributed local approximation of the minimum k-tuple dominating set in planar graphs

AU - Czygrinow, Andrzej

AU - Hanćkowiak, Michal

AU - Szymańska, Edyta

AU - Wawrzyniak, Wojciech

AU - Witkowski, Marcin

PY - 2014

Y1 - 2014

N2 - In this paper we consider a generalization of the classical dominating set problem to the k-tuple dominating set problem (kMDS). For any positive integer k, we look for a smallest subset of vertices D ⊆ V with the property that every vertex in V\D is adjacent to at least k vertices of D. We are interested in the distributed complexity of this problem in the model, where the nodes have no identifiers. The most challenging case is when k = 2, and for this case we propose a distributed local algorithm, which runs in a constant number of rounds, yielding a 7-approximation in the class of planar graphs. On the other hand, in the class of algorithms in which every vertex uses only its degree and the degree of its neighbors to make decisions, there is no algorithm providing a (5 -ϵ)-approximation of the 2MDS problem. In addition, we show a lower bound of (4 - ϵ) for the 2MDS problem even if unique identifiers are allowed.For k ≥ 3, we show that for the problem kMDS in planar graphs, a trivial algorithm yields a k/(k - 2)-approximation. In the model with unique identifiers this, surprisingly, is optimal for k = 3, 4, 5, and 6, as we provide a matching lower bound.

AB - In this paper we consider a generalization of the classical dominating set problem to the k-tuple dominating set problem (kMDS). For any positive integer k, we look for a smallest subset of vertices D ⊆ V with the property that every vertex in V\D is adjacent to at least k vertices of D. We are interested in the distributed complexity of this problem in the model, where the nodes have no identifiers. The most challenging case is when k = 2, and for this case we propose a distributed local algorithm, which runs in a constant number of rounds, yielding a 7-approximation in the class of planar graphs. On the other hand, in the class of algorithms in which every vertex uses only its degree and the degree of its neighbors to make decisions, there is no algorithm providing a (5 -ϵ)-approximation of the 2MDS problem. In addition, we show a lower bound of (4 - ϵ) for the 2MDS problem even if unique identifiers are allowed.For k ≥ 3, we show that for the problem kMDS in planar graphs, a trivial algorithm yields a k/(k - 2)-approximation. In the model with unique identifiers this, surprisingly, is optimal for k = 3, 4, 5, and 6, as we provide a matching lower bound.

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

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

M3 - Conference contribution

AN - SCOPUS:84917690957

SN - 9783319144719

VL - 8878

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 49

EP - 59

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Verlag

ER -