Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs

Andrzej Czygrinow, M. Hanćkowiak, E. Szymańska, W. Wawrzyniak, M. Witkowski

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

In this paper we consider the 2-dominating set problem (2MDS). We look for a smallest subset of vertices D⊆V with the property that every vertex in V∖D is adjacent to at least 2 vertices of D. We are interested in the distributed complexity of this problem in the local model, where the nodes have no identifiers but there is a port ordering available. We propose a distributed local (constant time) algorithm yielding a 6-approximation in the class of planar graphs. Earlier result shows that in this case, for any ϵ>0, there is no deterministic distributed local/constant-round algorithm providing a (5−ϵ)-approximation of the 2MDS.

Original languageEnglish (US)
Pages (from-to)1-8
Number of pages8
JournalTheoretical Computer Science
Volume662
DOIs
StatePublished - Feb 1 2017

Fingerprint

Local Algorithms
Local Approximation
Approximation algorithms
Dominating Set
Planar graph
Approximation Algorithms
Approximation
Vertex of a graph
Time Constant
Adjacent
Subset
Model

Keywords

  • Distributed graph algorithms

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs. / Czygrinow, Andrzej; Hanćkowiak, M.; Szymańska, E.; Wawrzyniak, W.; Witkowski, M.

In: Theoretical Computer Science, Vol. 662, 01.02.2017, p. 1-8.

Research output: Contribution to journalArticle

Czygrinow, Andrzej ; Hanćkowiak, M. ; Szymańska, E. ; Wawrzyniak, W. ; Witkowski, M. / Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs. In: Theoretical Computer Science. 2017 ; Vol. 662. pp. 1-8.
@article{2b58c020661342c2b2cace42f0b2cfc0,
title = "Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs",
abstract = "In this paper we consider the 2-dominating set problem (2MDS). We look for a smallest subset of vertices D⊆V with the property that every vertex in V∖D is adjacent to at least 2 vertices of D. We are interested in the distributed complexity of this problem in the local model, where the nodes have no identifiers but there is a port ordering available. We propose a distributed local (constant time) algorithm yielding a 6-approximation in the class of planar graphs. Earlier result shows that in this case, for any ϵ>0, there is no deterministic distributed local/constant-round algorithm providing a (5−ϵ)-approximation of the 2MDS.",
keywords = "Distributed graph algorithms",
author = "Andrzej Czygrinow and M. Hanćkowiak and E. Szymańska and W. Wawrzyniak and M. Witkowski",
year = "2017",
month = "2",
day = "1",
doi = "10.1016/j.tcs.2016.12.001",
language = "English (US)",
volume = "662",
pages = "1--8",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",

}

TY - JOUR

T1 - Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs

AU - Czygrinow, Andrzej

AU - Hanćkowiak, M.

AU - Szymańska, E.

AU - Wawrzyniak, W.

AU - Witkowski, M.

PY - 2017/2/1

Y1 - 2017/2/1

N2 - In this paper we consider the 2-dominating set problem (2MDS). We look for a smallest subset of vertices D⊆V with the property that every vertex in V∖D is adjacent to at least 2 vertices of D. We are interested in the distributed complexity of this problem in the local model, where the nodes have no identifiers but there is a port ordering available. We propose a distributed local (constant time) algorithm yielding a 6-approximation in the class of planar graphs. Earlier result shows that in this case, for any ϵ>0, there is no deterministic distributed local/constant-round algorithm providing a (5−ϵ)-approximation of the 2MDS.

AB - In this paper we consider the 2-dominating set problem (2MDS). We look for a smallest subset of vertices D⊆V with the property that every vertex in V∖D is adjacent to at least 2 vertices of D. We are interested in the distributed complexity of this problem in the local model, where the nodes have no identifiers but there is a port ordering available. We propose a distributed local (constant time) algorithm yielding a 6-approximation in the class of planar graphs. Earlier result shows that in this case, for any ϵ>0, there is no deterministic distributed local/constant-round algorithm providing a (5−ϵ)-approximation of the 2MDS.

KW - Distributed graph algorithms

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

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

U2 - 10.1016/j.tcs.2016.12.001

DO - 10.1016/j.tcs.2016.12.001

M3 - Article

AN - SCOPUS:85009077500

VL - 662

SP - 1

EP - 8

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

ER -