Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs
type: Item
instance of: scholarly article
title: Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs
zbMATH Open document ID: 1356.05146
published in: Theoretical Computer Science
publication date: 2017-01-09T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 6672921
zbMATH Keywords: distributed graph algorithms
author: Andrzej Czygrinow
author: Michal Hanckowiak
author: Edyta Szymańska
author: Wojciech Wawrzyniak
author: Marcin Witkowski
MaRDI profile type: Publication
full work available at URL: j.tcs.2016.12.001
OpenAlex ID: W2561474155
cites work: Fast Distributed Approximations in Planar Graphs
cites work: Q3577833
cites work: Q3691778
cites work: Q4198056
cites work: Lower bounds for local approximation
cites work: Q4368729
cites work: Q4734763
cites work: An efficient distributed algorithm for constructing small dominating sets
cites work: Hardness results and approximation algorithms of \(k\)-tuple domination in graphs
cites work: Algorithmic aspects of the \(k\)-domination problem in graphs
cites work: Distributed minimum dominating set approximations in restricted families of graphs
cites work: The Algorithmic Complexity of k-Domatic Partition of Graphs
cites work: Distributed Computing: A Locality-Sensitive Approach
cites work: Q4527015
cites work: Survey of local algorithms
cites work: A strengthened analysis of a local algorithm for the minimum dominating set problem in planar graphs
DOI: 10.1016/J.TCS.2016.12.001
description: scientific article; zbMATH DE number 6672921