Login / Signup

Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems.

Tsung-Chyan Lai
Published in: Oper. Res. Lett. (1993)
Keyphrases
  • greedy algorithms
  • worst case analysis
  • knapsack problem
  • greedy algorithm
  • average case
  • np hardness
  • optimization problems
  • greedy heuristic
  • search algorithm
  • worst case
  • np complete
  • scheduling problem