Polynomial-time approximation scheme for minimum connected dominating set under routing cost constraint in wireless sensor networks (Q443711)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6065016
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial-time approximation scheme for minimum connected dominating set under routing cost constraint in wireless sensor networks |
scientific article; zbMATH DE number 6065016 |
Statements
Polynomial-time approximation scheme for minimum connected dominating set under routing cost constraint in wireless sensor networks (English)
0 references
13 August 2012
0 references
polynomial-time approximation
0 references
minimum connected dominating set
0 references
routing cost constraint
0 references
wireless sensor networks
0 references
0 references
0.958871603012085
0 references
0.8701432347297668
0 references
