On minimum \(m\)-connected \(k\)-dominating set problem in unit disc graphs (Q1016039)
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 minimum \(m\)-connected \(k\)-dominating set problem in unit disc graphs |
scientific article; zbMATH DE number 5550474
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On minimum \(m\)-connected \(k\)-dominating set problem in unit disc graphs |
scientific article; zbMATH DE number 5550474 |
Statements
On minimum \(m\)-connected \(k\)-dominating set problem in unit disc graphs (English)
0 references
4 May 2009
0 references
\(k\)-dominating set
0 references
\(m\)-connectivity
0 references
unit disc graph
0 references
approximation algorithm
0 references
wireless sensor networks
0 references
0 references
0.93996346
0 references
0.9303245
0 references
0.9242438
0 references
0.9194777
0 references
0.9137939
0 references
0 references
0.9134087
0 references
0.9123426
0 references
