An average case analysis of the minimum spanning tree heuristic for the power assignment problem (Q5236925): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/rsa.20831 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1832814332 / rank | |||
Normal rank | |||
Revision as of 19:58, 19 March 2024
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
