A greedy algorithm for the fault-tolerant connected dominating set in a general graph
type: Item
instance of: scholarly article
title: A greedy algorithm for the fault-tolerant connected dominating set in a general graph
zbMATH Open document ID: 1298.90122
author: Jiao Zhou
author: Zhao Zhang
author: Weili Wu
author: Kai Xing
published in: Journal of Combinatorial Optimization
publication date: 2014-09-05T00:00:00Z
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6340727
zbMATH Keywords: \(m\)-fold connected dominating set
zbMATH Keywords: non-submodular potential function
zbMATH Keywords: greedy algorithm
MaRDI profile type: Publication
full work available at URL: s10878-013-9638-4
OpenAlex ID: W2001733582
cites work: A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
cites work: On constructing \(k\)-connected \(k\)-dominating set in wireless ad hoc and sensor networks
cites work: Q3579442
cites work: Design and analysis of approximation algorithms
cites work: ANALYSIS ON THEORETICAL BOUNDS FOR APPROXIMATING DOMINATING SET PROBLEMS
cites work: Approximation algorithms for connected dominating sets
cites work: MINIMUM CONNECTED r-HOP k-DOMINATING SET IN WIRELESS NETWORKS
cites work: Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks
cites work: On the construction of \(k\)-connected \(m\)-dominating sets in wireless networks
cites work: A greedy approximation for minimum connected dominating sets
cites work: On minimum \(m\)-connected \(k\)-dominating set problem in unit disc graphs
cites work: On approximation algorithms of \(k\)-connected \(m\)-dominating sets in disk graphs
cites work: Minimum connected dominating sets and maximal independent sets in unit disk graphs
cites work: A PTAS for minimum connected dominating set in 3-dimensional wireless sensor networks
cites work: TWO ALGORITHMS FOR CONNECTED r-HOP k-DOMINATING SET
DOI: 10.1007/S10878-013-9638-4
description: scientific article; zbMATH DE number 6340727