Combinatorics of the change-making problem

Authors:
Anna Adamaszek;Michal Adamaszek
Affiliations:
Department of Computer Science, University of Warwick, Coventry, CV4 7AL, UK and Centre for Discrete Mathematics and its Applications (DIMAP), University of Warwick, Coventry, CV4 7AL, UK;Centre for Discrete Mathematics and its Applications (DIMAP), University of Warwick, Coventry, CV4 7AL, UK and Warwick Mathematics Institute, University of Warwick, Coventry, CV4 7AL, UK
Venue:
European Journal of Combinatorics
Year:
2010

Citing 2
Cited 1

Optimal bounds for the change-making problem

Theoretical Computer Science
A polynomial-time algorithm for the change-making problem

Operations Research Letters

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

We investigate the structure of the currencies (systems of coins) for which the greedy change-making algorithm always finds an optimal solution (that is, a one with minimum number of coins). We present a series of necessary conditions that must be satisfied by the values of coins in such systems. We also uncover some relations between such currencies and their sub-currencies.