Each week, we select a recently published Open Access article to feature. This week’s article comes from Random Structures and Algorithms and presents an average case analysis of the minimum spanning tree heuristic for the power assignment problem.
The article’s abstract is given below, with the full article available to read here.
de Graaf, M, , , . An average case analysis of the minimum spanning tree heuristic for the power assignment problem. Random Struct Alg. 2019; 55: 89– 103. https://doi.org/10.1002/rsa.20831
We present an average case analysis of the minimum spanning tree heuristic for the power assignment problem. The worst‐case approximation ratio of this heuristic is 2. We show that in Euclidean d‐dimensional space, when the vertex set consists of a set of i.i.d. uniform random independent, identically distributed random variables in [0,1]d, and the distance power gradient equals the dimension d, the minimum spanning tree‐based power assignment converges completely to a constant depending only on d.
More Details