Approximation algorithms for minimum power \(k\) backbone node \(r\)-connected subgraph problem in wireless sensor networks (Q5216451)
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: Approximation algorithms for minimum power k backbone node r-connected subgraph problem in wireless sensor networks |
scientific article; zbMATH DE number 7168512
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for minimum power \(k\) backbone node \(r\)-connected subgraph problem in wireless sensor networks |
scientific article; zbMATH DE number 7168512 |
Statements
Approximation algorithms for minimum power k backbone node r-connected subgraph problem in wireless sensor networks (English)
0 references
18 February 2020
0 references
wireless sensor networks
0 references
topology control problem
0 references
range assignment
0 references
graph algorithms
0 references
approximation algorithms
0 references
0.9305912256240844
0 references
0.8397266268730164
0 references
0.8298677802085876
0 references
0.8160946369171143
0 references
0.8099130988121033
0 references
