On approximation algorithms of \(k\)-connected \(m\)-dominating sets in disk graphs (Q2456357)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On approximation algorithms of \(k\)-connected \(m\)-dominating sets in disk graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On approximation algorithms of \(k\)-connected \(m\)-dominating sets in disk graphs |
scientific article |
Statements
On approximation algorithms of \(k\)-connected \(m\)-dominating sets in disk graphs (English)
0 references
18 October 2007
0 references
connected dominating set
0 references
virtual backbone
0 references
fault tolerance
0 references
wireless ad hoc network
0 references
disk graphs
0 references
