A polynomial-time algorithm for the change-making problem

Authors:
David Pearson
Affiliations:
BBN Technologies, 10 Moulton Street, Cambridge, MA 02138, USA
Venue:
Operations Research Letters
Year:
2005

Citing 3
Cited 2

Optimal bounds for the change-making problem

Theoretical Computer Science
Algorithmic Solution of the Change-Making Problem

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Combinatorics of the change-making problem

European Journal of Combinatorics
Managing change in the era of the iPhone

FUN'10 Proceedings of the 5th international conference on Fun with algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

Optimally making change-representing a given value with the fewest coins from a set of denominations-is in general NP-hard. In most real money systems however, the greedy algorithm is optimal. We give a polynomial-time algorithm to determine, for a given coin system, whether the greedy algorithm is optimal.