Login / Signup

An average case analysis of the minimum spanning tree heuristic for the power assignment problem.

Maurits de GraafRichard J. BoucherieJohann L. HurinkJan-Kees C. W. van Ommeren
Published in: Random Struct. Algorithms (2019)
Keyphrases
  • average case
  • minimum spanning tree
  • worst case
  • worst case analysis
  • graph theory
  • objective function
  • optimal solution
  • search algorithm
  • cost function
  • simulated annealing
  • graph cuts
  • uniform distribution
  • spanning tree