Back to Search
Start Over
Error Bounds and the Applicability of the Greedy Solution to the Coin-Changing Problem.
- Source :
- Operations Research; May/Jun77, Vol. 25 Issue 3, p404, 15p
- Publication Year :
- 1977
-
Abstract
- Necessary and sufficient conditions have been given that characterize the data for which a greedy algorithm solves the coin-changing problem. In this paper we study the problem of maximum percentage error when the greedy solution does not work. We also generalize a result of Johnson and Kernighan to the case for which each coin is of different weight. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 0030364X
- Volume :
- 25
- Issue :
- 3
- Database :
- Complementary Index
- Journal :
- Operations Research
- Publication Type :
- Academic Journal
- Accession number :
- 6668829