Algorithms for minimum \(m\)-connected \(k\)-tuple dominating set problem (Q995580)
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: Algorithms for minimum m-connected k-tuple dominating set problem |
scientific article; zbMATH DE number 5186619
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for minimum \(m\)-connected \(k\)-tuple dominating set problem |
scientific article; zbMATH DE number 5186619 |
Statements
Algorithms for minimum \(m\)-connected \(k\)-tuple dominating set problem (English)
0 references
3 September 2007
0 references
connected dominating set
0 references
approximation algorithm
0 references
\(k\)-vertex connectivity
0 references
wireless sensor networks
0 references
0.9637765288352966
0 references
0.8645080327987671
0 references
0.8509765863418579
0 references
0.8457469940185547
0 references
0.8451141715049744
0 references
