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
N1 - Funding Information:
Research supported in part by Simons Foundation Grant # 521777.
Publisher Copyright:
© 2018 Elsevier B.V.
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
SN - 0304-3975
VL - 757
SP - 1
EP - 10
JO - Theoretical Computer Science
JF - Theoretical Computer Science
ER -