A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs
type: Item
instance of: scholarly article
title: A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs
zbMATH Open document ID: 1285.68017
author: Sayaka Kamei
author: Hirotsugu Kakugawa
published in: Theoretical Computer Science
publication date: 2012-05-30T00:00:00Z
Mathematics Subject Classification ID: 68M15
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 6039153
zbMATH Keywords: self-stabilization
zbMATH Keywords: safe convergence
zbMATH Keywords: the minimum connected dominating set
MaRDI profile type: Publication
full work available at URL: j.tcs.2011.12.007
OpenAlex ID: W2043506259
cites work: Unit disk graphs
cites work: Self-stabilizing systems in spite of distributed control
cites work: Self-stabilization
cites work: Q4259989
cites work: Q4457225
cites work: A SELF-STABILIZING DISTRIBUTED APPROXIMATION ALGORITHM FOR THE MINIMUM CONNECTED DOMINATING SET
cites work: Stabilization of general loop-free routing
cites work: Q4457231
cites work: Robust self-stabilizing weight-based clustering algorithm
cites work: Q5692521
cites work: Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
cites work: Constant-time distributed dominating set approximation
cites work: Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes
cites work: Distributed algorithms for connected domination in wireless networks
cites work: Simple heuristics for unit disk graphs
cites work: Stabilizing phase-clocks
cites work: A transformation of self-stabilizing serial model programs for asynchronous parallel computing environments
cites work: Distributed Computing - IWDC 2003
cites work: Q3277097
cites work: Theoretical Bound and Practical Analysis of Connected Dominating Set in Ad Hoc and Sensor Networks
cites work: Distributed reset
cites work: A self-stabilizing algorithm for the shortest path problem assuming the distributed demon
cites work: Self-stabilizing algorithms for minimal dominating sets and maximal independent sets
DOI: 10.1016/J.TCS.2011.12.007
description: scientific article; zbMATH DE number 6039153