Combinatorics of the change-making problem
Adamaszek, Anna and Adamaszek, Michał. (2010) Combinatorics of the change-making problem. European Journal of Combinatorics, Vol.31 (No.1). pp. 47-63. ISSN 0195-6698Full text not available from this repository.
Official URL: http://dx.doi.org/10.1016/j.ejc.2009.05.002
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. (C) 2009 Elsevier Ltd. All rights reserved.
|Item Type:||Journal Article|
|Subjects:||Q Science > QA Mathematics|
|Divisions:||Faculty of Science > Computer Science
Faculty of Science > Mathematics
|Journal or Publication Title:||European Journal of Combinatorics|
|Number of Pages:||17|
|Page Range:||pp. 47-63|
|Access rights to Published version:||Restricted or Subscription Access|
Actions (login required)