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 language | English (US) |
---|---|
Journal | Theoretical Computer Science |
DOIs | |
State | Accepted/In press - Jan 1 2018 |
Fingerprint
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
}
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 -