Adamaszek, Anna and Adamaszek, Michał (2010) Combinatorics of the change-making problem. European Journal of Combinatorics, Vol.31 (No.1). pp. 47-63. doi:10.1016/j.ejc.2009.05.002 ISSN 0195-6698.

Text sdarticle.pdf - Published Version Embargoed item. Restricted access to Repository staff only Download (877Kb)

Request Changes to record.

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.

Item Type:	Journal Article
Subjects:	Q Science > QA Mathematics
Divisions:	Faculty of Science, Engineering and Medicine > Science > Computer Science Faculty of Science, Engineering and Medicine > Science > Mathematics
Journal or Publication Title:	European Journal of Combinatorics
Publisher:	Academic Press
ISSN:	0195-6698
Official Date:	January 2010
Dates:	Date Event January 2010 Published
Volume:	Vol.31
Number:	No.1
Number of Pages:	17
Page Range:	pp. 47-63
DOI:	10.1016/j.ejc.2009.05.002
Status:	Peer Reviewed
Publication Status:	Published
Access rights to Published version:	Restricted or Subscription Access
Date of first compliant deposit:	8 December 2015

Data sourced from Thomson Reuters' Web of Knowledge

Request changes or add full text files to a record

Repository staff actions (login required)

View Item