Distributed CONGESTBC constant approximation of MDS in bounded genus graphs

Andrzej Czygrinow, Michał Hanćkowiak, Wojciech Wawrzyniak, Marcin Witkowski

Research output: Contribution to journal › Article

Abstract

We give a distributed algorithm which finds a constant approximation of a minimum dominating set in graphs of constant genus. The algorithm works in the CONGESTBC model (distributed, synchronous, with short messages and broadcast type of transmissions) and runs in a constant number of distributed rounds.

Original languageEnglish (US)
JournalTheoretical Computer Science
DOIs
StateAccepted/In press - Jan 1 2018

Fingerprint

Parallel algorithms
Genus
Approximation
Graph in graph theory
Dominating Set
Distributed Algorithms
Broadcast
Model

Keywords

  • Bounded genus graphs
  • Distributed algorithms
  • Local algorithms
  • Minimum dominating set

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Distributed CONGESTBC constant approximation of MDS in bounded genus graphs. / Czygrinow, Andrzej; Hanćkowiak, Michał; Wawrzyniak, Wojciech; Witkowski, Marcin.

In: Theoretical Computer Science, 01.01.2018.

Research output: Contribution to journal › Article

Czygrinow, A, Hanćkowiak, M, Wawrzyniak, W & Witkowski, M 2018, 'Distributed CONGESTBC constant approximation of MDS in bounded genus graphs', Theoretical Computer Science. https://doi.org/10.1016/j.tcs.2018.07.008
Czygrinow A, Hanćkowiak M, Wawrzyniak W, Witkowski M. Distributed CONGESTBC constant approximation of MDS in bounded genus graphs. Theoretical Computer Science. 2018 Jan 1. https://doi.org/10.1016/j.tcs.2018.07.008
Czygrinow, Andrzej ; Hanćkowiak, Michał ; Wawrzyniak, Wojciech ; Witkowski, Marcin. / Distributed CONGESTBC constant approximation of MDS in bounded genus graphs. In: Theoretical Computer Science. 2018.
@article{27beaac656db4f0ca7a4cb3bdb076449,
title = "Distributed CONGESTBC constant approximation of MDS in bounded genus graphs",
abstract = "We give a distributed algorithm which finds a constant approximation of a minimum dominating set in graphs of constant genus. The algorithm works in the CONGESTBC model (distributed, synchronous, with short messages and broadcast type of transmissions) and runs in a constant number of distributed rounds.",
keywords = "Bounded genus graphs, Distributed algorithms, Local algorithms, Minimum dominating set",
author = "Andrzej Czygrinow and Michał Hanćkowiak and Wojciech Wawrzyniak and Marcin Witkowski",
year = "2018",
month = "1",
day = "1",
doi = "10.1016/j.tcs.2018.07.008",
language = "English (US)",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",

}

TY - JOUR

T1 - Distributed CONGESTBC constant approximation of MDS in bounded genus graphs

AU - Czygrinow, Andrzej

AU - Hanćkowiak, Michał

AU - Wawrzyniak, Wojciech

AU - Witkowski, Marcin

PY - 2018/1/1

Y1 - 2018/1/1

N2 - We give a distributed algorithm which finds a constant approximation of a minimum dominating set in graphs of constant genus. The algorithm works in the CONGESTBC model (distributed, synchronous, with short messages and broadcast type of transmissions) and runs in a constant number of distributed rounds.

AB - We give a distributed algorithm which finds a constant approximation of a minimum dominating set in graphs of constant genus. The algorithm works in the CONGESTBC model (distributed, synchronous, with short messages and broadcast type of transmissions) and runs in a constant number of distributed rounds.

KW - Bounded genus graphs

KW - Distributed algorithms

KW - Local algorithms

KW - Minimum dominating set

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

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

U2 - 10.1016/j.tcs.2018.07.008

DO - 10.1016/j.tcs.2018.07.008

M3 - Article

AN - SCOPUS:85051043127

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

ER -

Access to Document