On approximation algorithms of -connected -dominating sets in disk graphs
Authors:
- My T. ThaiMTMy T. Thai
- Ning ZhangNZNing Zhang
- Ravi TiwariRTRavi Tiwari
- Xiaochun XuXXXiaochun Xu
- 1 October 2007
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 385 (1-3) , 49-59
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A dominating and absorbent set in a wireless ad-hoc network with different transmission ranges2007
- Connected Dominating Sets in Wireless Networks with Different Transmission RangesIEEE Transactions on Mobile Computing, 2007
- Connected dominating sets in disk graphs with bidirectional linksIEEE Communications Letters, 2006
- On greedy construction of connected dominating sets in wireless networksWireless Communications and Mobile Computing, 2005
- A polynomial‐time approximation scheme for the minimum‐connected dominating set in ad hoc wireless networksNetworks, 2003
- Distributed heuristics for connected dominating sets in wireless ad hoc networksJournal of Communications and Networks, 2002
- Approximation Algorithms for Connected Dominating SetsAlgorithmica, 1998
- Unit disk graphsDiscrete Mathematics, 1990