Algorithms for the minimum weight \(k\)-fold (connected) dominating set problem
type: Item
instance of: scholarly article
title: Algorithms for the minimum weight \(k\)-fold (connected) dominating set problem
zbMATH Open document ID: 1244.90234
author: Wenkai Ma
author: Deying Li
author: Zhao Zhang
published in: Journal of Combinatorial Optimization
publication date: 2012-07-17T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6057750
zbMATH Keywords: \(k\)-fold dominating set
zbMATH Keywords: slab decomposition
zbMATH Keywords: algorithm
zbMATH Keywords: unit ball graph
MaRDI profile type: Publication
full work available at URL: s10878-010-9372-0
OpenAlex ID: W2036620201
cites work: Q5692521
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: A threshold of ln n for approximating set cover
cites work: Q4198056
cites work: Approximation algorithms for connected dominating sets
cites work: NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
cites work: Approximation algorithms for combinatorial problems
cites work: Constant-time distributed dominating set approximation
cites work: Improving construction for connected dominating set with Steiner tree in wireless sensor networks
cites work: A greedy approximation for minimum connected dominating sets
cites work: Graph-Theoretic Concepts in Computer Science
cites work: A PTAS for minimum connected dominating set in 3-dimensional wireless sensor networks
DOI: 10.1007/S10878-010-9372-0
Recommended article: Algorithms for Minimum m-Connected k-Dominating Set Problem
Recommended article: Algorithms for minimum \(m\)-connected \(k\)-tuple dominating set problem
Recommended article: ALGORITHMS FOR MINIMUM CONNECTED CAPACITATED DOMINATING SET PROBLEM
Recommended article: Computing Minimum k-Connected m-Fold Dominating Set in General Graphs
Recommended article: A greedy algorithm for the minimum \(2\)-connected \(m\)-fold dominating set problem
Recommended article: Q3150852
Recommended article: Approximation algorithm for the minimum weight connected \(k\)-subgraph cover problem
Recommended article: Approximation algorithms for connected dominating sets
Recommended article: The Minimum Connected Dominating Set Problem: Formulation, Valid Inequalities and a Branch-and-Cut Algorithm
description: scientific article; zbMATH DE number 6057750