Bounding Condition
Let c(F) be the cost of the current forest of k trees where tree Ti had minimum degree vertex di sorted smallest to largest. Let B be the best cost of any tree so far.
The lowest possible cost of any tree containing F is
If m(F) > B then do not continue searching from F.