ALGORITHMS FOR MINIMUM CONNECTED CAPACITATED DOMINATING SET PROBLEM

DOI10.1142/S1793830911000961zbMath1214.68470OpenAlexW2054473698MaRDI QIDQ3007757

Xiumei Wang, Wei-Ping Shang

Publication date: 17 June 2011

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830911000961

zbMATH Keywords

approximation algorithmunit disk graphcapacitated dominating set

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Approximation algorithms (68W25)

Cites Work

• Minimum connected dominating sets and maximal independent sets in unit disk graphs
• Generalized submodular cover problems and applications
• How to Allocate Network Centers

This page was built for publication: ALGORITHMS FOR MINIMUM CONNECTED CAPACITATED DOMINATING SET PROBLEM