A local approximation algorithm for minimum dominating set problem in anonymous planar networks
type: Item
instance of: scholarly article
title: A local approximation algorithm for minimum dominating set problem in anonymous planar networks
zbMATH Open document ID: 1342.68351
author: Wojciech Wawrzyniak
published in: Distributed Computing
publication date: 2015-10-20T00:00:00Z
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 6496239
zbMATH Keywords: approximation
zbMATH Keywords: local algorithm
zbMATH Keywords: dominating set
zbMATH Keywords: planar graph
MaRDI profile type: Publication
full work available at URL: s00446-015-0247-6
OpenAlex ID: W1161997546
cites work: Brief Announcement: Distributed Approximations for the Semi-matching Problem
cites work: Distributed 2-Approximation Algorithm for the Semi-matching Problem
cites work: Fast Distributed Approximations in Planar Graphs
cites work: Q3577833
cites work: Lower bounds for local approximation
cites work: Distributed minimum dominating set approximations in restricted families of graphs
cites work: The price of being near-sighted
cites work: Constant-time distributed dominating set approximation
cites work: Locality in Distributed Graph Algorithms
cites work: What Can be Computed Locally?
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.1007/S00446-015-0247-6
description: scientific article; zbMATH DE number 6496239