Distributed CONGESTBC constant approximation of MDS in bounded genus graphs

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

doi:10.1016/j.tcs.2018.07.008

Distributed CONGEST_BC constant approximation of MDS in bounded genus graphs

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

Mathematical and Statistical Sciences, School of (SMSS)

Research output: Contribution to journal › Article › peer-review

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 CONGEST_BC model (distributed, synchronous, with short messages and broadcast type of transmissions) and runs in a constant number of distributed rounds.

Original language	English (US)
Pages (from-to)	1-10
Number of pages	10
Journal	Theoretical Computer Science
Volume	757
DOIs	https://doi.org/10.1016/j.tcs.2018.07.008
State	Published - Jan 24 2019

Keywords

Bounded genus graphs
Distributed algorithms
Local algorithms
Minimum dominating set

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1016/j.tcs.2018.07.008

Cite this

@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{\l} Han{\'c}kowiak and Wojciech Wawrzyniak and Marcin Witkowski",

note = "Funding Information: Research supported in part by Simons Foundation Grant # 521777. Publisher Copyright: {\textcopyright} 2018 Elsevier B.V.",

year = "2019",

month = jan,

day = "24",

doi = "10.1016/j.tcs.2018.07.008",

language = "English (US)",

volume = "757",

pages = "1--10",

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 - 2019/1/24

Y1 - 2019/1/24

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

VL - 757

SP - 1

EP - 10

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

ER -