Tighter approximation bounds for minimum CDS in unit disk graphs

DOI10.1007/s00453-011-9512-7zbMath1231.68182MaRDI QIDQ652528

Peng-Jun Wan, Minming Li, Frances F. Yao

Publication date: 14 December 2011

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-011-9512-7

zbMATH Keywords

approximation algorithm; geometric analysis; connected dominating set; wireless ad hoc networks

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

68M14: Distributed systems

68W25: Approximation algorithms