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

  • Authors:

  • Tsung-Chyan Lai

  • Affiliations:

  • Department of Industrial and Business Administration, College of Management, National Taiwan University, Taipei, Taiwan

  • Venue:
  • Operations Research Letters
  • Year:
  • 1993

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present on O(n log n) greedy a O(n log n) greedy algorithm with a worst-case performance ratio of 23 for the subset-sum problem, and an O(n log n) greedy algorithm with a worst-case performance ratio of 87 for the partition problem. These greedy algorithms, in the sense of worst-case performance, are better than other known O(n log n) greedy algorithms