An average case analysis of the minimum spanning tree heuristic for the power assignment problem (Q5236925)
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: An average case analysis of the minimum spanning tree heuristic for the power assignment problem |
scientific article; zbMATH DE number 7118074
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An average case analysis of the minimum spanning tree heuristic for the power assignment problem |
scientific article; zbMATH DE number 7118074 |
Statements
An average case analysis of the minimum spanning tree heuristic for the power assignment problem (English)
0 references
16 October 2019
0 references
ad-hoc networks
0 references
analysis of algorithms
0 references
approximation algorithms
0 references
average case analysis
0 references
point processes
0 references
power assignment
0 references
range assignment
0 references
0.8641498
0 references
0.8441577
0 references
0.8423885
0 references
0.84175515
0 references
0.8403015
0 references
0.8386488
0 references
