Canonical Coin Systems for Change-Making Problems
| dc.creator | Cai, Xuan | |
| dc.date | 2008-09-02 | |
| dc.date | 2009-03-21 | |
| dc.date.accessioned | 2026-07-07T12:54:30Z | |
| dc.date.available | 2026-07-07T12:54:30Z | |
| dc.description | 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, in most 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 \emph{canonical} coin systems with four or five types of coins, and a sufficient condition for non-canonical coin systems, respectively. Moreover, we present an $O(m^2)$ algorithm that decides whether a tight coin system is canonical. | |
| dc.description | 7 pages | |
| dc.identifier | https://arxiv.org/abs/0809.0400 | |
| dc.identifier | http://arxiv.org/abs/0809.0400 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/223953 | |
| dc.subject | Data Structures and Algorithms | |
| dc.subject | Discrete Mathematics | |
| dc.subject | G.2.1 | |
| dc.title | Canonical Coin Systems for Change-Making Problems | |
| dc.type | text |