Login / Signup

A greedy heuristic for a minimum-weight forest problem.

Celina ImielinskaBahman KalantariLeonid Khachiyan
Published in: Oper. Res. Lett. (1993)
Keyphrases
  • greedy heuristic
  • minimum weight
  • np hard
  • greedy algorithm
  • knapsack problem
  • optimal solution
  • lower bound
  • maximum cardinality
  • scheduling problem
  • bayesian networks
  • evolutionary algorithm
  • special case