Cite

    Maurits Graaf et al.. “An average case analysis of the minimum spanning tree heuristic for the power assignment problem.” Random structures & algorithms, vol. 55, no. 1, 2019, pp. 89–103. http://access.bl.uk/ark:/81055/vdc_100086209591.0x000028