Distributed \(\mathcal{CONGEST}_{B C}\) constant approximation of MDS in bounded genus graphs
type: Item
instance of: scholarly article
title: Distributed \(\mathcal{CONGEST}_{B C}\) constant approximation of MDS in bounded genus graphs
zbMATH Open document ID: 1410.68381
author: Andrzej Czygrinow
author: Michal Hanckowiak
author: Wojciech Wawrzyniak
author: Marcin Witkowski
published in: Theoretical Computer Science
publication date: 2019-01-18T00:00:00Z
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 7003509
zbMATH Keywords: distributed algorithms
zbMATH Keywords: minimum dominating set
zbMATH Keywords: bounded genus graphs
zbMATH Keywords: local algorithms
MaRDI profile type: Publication
full work available at URL: j.tcs.2018.07.008
OpenAlex ID: W2883955106
cites work: A Local Constant Factor MDS Approximation for Bounded Genus Graphs
cites work: Fast Distributed Approximations in Planar Graphs
cites work: Q4198056
cites work: Lower bounds for local approximation
cites work: Constant-time distributed dominating set approximation
cites work: Distributed minimum dominating set approximations in restricted families of graphs
cites work: Leveraging Linial’s Locality Limit
cites work: Survey of local algorithms
cites work: A strengthened analysis of a local algorithm for the minimum dominating set problem in planar graphs
cites work: A local approximation algorithm for minimum dominating set problem in anonymous planar networks
DOI: 10.1016/J.TCS.2018.07.008
description: scientific article; zbMATH DE number 7003509