Two algorithms for minimum 2-connected \(r\)-hop dominating set
type: Item
instance of: scholarly article
title: Two algorithms for minimum 2-connected \(r\)-hop dominating set
zbMATH Open document ID: 1379.68355
author: Xiuying Li
author: Zhao Zhang
published in: Information Processing Letters
publication date: 2017-11-03T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 6802645
zbMATH Keywords: approximation algorithms
zbMATH Keywords: wireless sensor network
zbMATH Keywords: \(r\)-hop dominating set
zbMATH Keywords: fault-tolerant
zbMATH Keywords: unit disk graph
MaRDI profile type: Publication
full work available at URL: j.ipl.2010.08.008
OpenAlex ID: W2046498514
cites work: Q5692521
cites work: Q5422499
cites work: A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
cites work: Unit disk graphs
cites work: Approximation algorithms for connected dominating sets
cites work: MINIMUM CONNECTED r-HOP k-DOMINATING SET IN WIRELESS NETWORKS
cites work: A greedy approximation for minimum connected dominating sets
cites work: Algorithms for minimum \(m\)-connected \(k\)-tuple dominating set problem
cites work: A quick method for finding shortest pairs of disjoint paths
cites work: A PTAS FOR MINIMUM d-HOP UNDERWATER SINK PLACEMENT PROBLEM IN 2-D UNDERWATER SENSOR NETWORKS
cites work: TWO ALGORITHMS FOR CONNECTED r-HOP k-DOMINATING SET
DOI: 10.1016/J.IPL.2010.08.008
description: scientific article; zbMATH DE number 6802645