A better approximation for constructing virtual backbone in 3D wireless ad-hoc networks

DOI10.1016/j.tcs.2015.07.061zbMath1333.68210OpenAlexW1202552276MaRDI QIDQ896118

Jun Li, Xiaofeng Gao, Guihai Chen

Publication date: 11 December 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.07.061

zbMATH Keywords

virtual backboneunit ball graphconnected dominating set (CDS)wireless ad-hoc network

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Approximation algorithms (68W25) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (1)

On constructing strongly connected dominating and absorbing set in 3-dimensional wireless ad hoc networks

Cites Work

• Unnamed Item
• Unnamed Item
• On connected domination in unit ball graphs
• Tighter approximation bounds for minimum CDS in unit disk graphs
• Minimum connected dominating sets and maximal independent sets in unit disk graphs
• Sphere packings. (Edited by John Talbot)
• ANALYSIS ON THEORETICAL BOUNDS FOR APPROXIMATING DOMINATING SET PROBLEMS

This page was built for publication: A better approximation for constructing virtual backbone in 3D wireless ad-hoc networks