An exact algorithm for minimum CDS with shortest path constraint in wireless networks
- 9 June 2010
- journal article
- research article
- Published by Springer Nature in Optimization Letters
- Vol. 5 (2) , 297-306
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Improving Construction for Connected Dominating Set with Steiner Tree in Wireless Sensor NetworksJournal of Global Optimization, 2006
- Minimum connected dominating sets and maximal independent sets in unit disk graphsTheoretical Computer Science, 2006
- Virtual backbone construction in multihop ad hoc wireless networksWireless Communications and Mobile Computing, 2006
- A greedy approximation for minimum connected dominating setsTheoretical Computer Science, 2004
- A polynomial‐time approximation scheme for the minimum‐connected dominating set in ad hoc wireless networksNetworks, 2003
- Message-optimal connected dominating sets in mobile ad hoc networks2002
- On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networksJournal of Communications and Networks, 2002
- STEINER TREE PROBLEMS2001
- Approximation Algorithms for Connected Dominating SetsAlgorithmica, 1998
- Unit disk graphsDiscrete Mathematics, 1990