On approximation algorithms of \(k\)-connected \(m\)-dominating sets in disk graphs
type: Item
instance of: scholarly article
title: On approximation algorithms of \(k\)-connected \(m\)-dominating sets in disk graphs
zbMATH Open document ID: 1124.68082
author: My T. Thai
author: Ning Zhang
author: Ravi Tiwari
author: Xiaochun Xu
published in: Theoretical Computer Science
publication date: 2007-10-18T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68M15
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 5201832
zbMATH Keywords: connected dominating set
zbMATH Keywords: virtual backbone
zbMATH Keywords: fault tolerance
zbMATH Keywords: wireless ad hoc network
zbMATH Keywords: disk graphs
MaRDI profile type: Publication
full work available at URL: j.tcs.2007.05.025
OpenAlex ID: W2011806775
cites work: Q4198056
cites work: Unit disk graphs
cites work: The broadcast storm problem in a mobile ad hoc network
cites work: Approximation algorithms for connected dominating sets
cites work: A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
DOI: 10.1016/J.TCS.2007.05.025
description: scientific article