The minimum cost hop-and-root constrained forest in wireless sensor networks (Q2840531)
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 6189804
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The minimum cost hop-and-root constrained forest in wireless sensor networks |
scientific article; zbMATH DE number 6189804 |
Statements
19 July 2013
0 references
combinatorial optimization
0 references
hop-constrained trees
0 references
network flows
0 references
heuristics
0 references
The minimum cost hop-and-root constrained forest in wireless sensor networks (English)
0 references
0.8532761335372925
0 references
0.777592658996582
0 references
0.7670096158981323
0 references
0.7642893195152283
0 references
0.7611601948738098
0 references
