Abstract
The Change-Making problem is to represent a given value with the fewest coins under a given coin system. As a variation of the knapsack problem, it is known to be NP-hard. Nevertheless, inmost real money systems, the greedy algorithm yields optimal solutions. In this paper, we study what type of coin systems that guarantee the optimality of the greedy algorithm. We provide new proofs for a sufficient and necessary condition for the so-called canonical coin systems with 4 or 5 types of coins, and a sufficient condition for non-canonical coin systems, respectively.Moreover, we propose an $O(m^2)$ algorithm that decides whether a tight coin system is canonical.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
