Cite
HARVARD Citation
Graaf, M. et al. (2019). An average case analysis of the minimum spanning tree heuristic for the power assignment problem. Random structures & algorithms. 55 (1), pp. 89-103. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Graaf, M. et al. (2019). An average case analysis of the minimum spanning tree heuristic for the power assignment problem. Random structures & algorithms. 55 (1), pp. 89-103. [Online].