Combinatorics of the change-making problem
From MaRDI portal
Publication:1041183
DOI10.1016/j.ejc.2009.05.002zbMath1178.90281arXiv0801.0120OpenAlexW2079740697WikidataQ56608115 ScholiaQ56608115MaRDI QIDQ1041183
Anna Adamaszek, Michał Adamaszek
Publication date: 1 December 2009
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0801.0120
Related Items
Greedy routing in circulant networks ⋮ What's in \textit{YOUR} wallet? ⋮ Unnamed Item ⋮ Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ Change-making problems revisited: a parameterized point of view ⋮ When greedy gives optimal: a unified approach ⋮ Characterization of canonical systems with six types of coins for the change-making problem
Cites Work
- Totally greedy coin sets and greedy obstructions
- Optimal bounds for the change-making problem
- A polynomial-time algorithm for the change-making problem
- When the Greedy Solution Solves a Class of Knapsack Problems
- Technical Note—Optimality of a Heuristic Solution for a Class of Knapsack Problems
- Error Bounds and the Applicability of the Greedy Solution to the Coin-Changing Problem
- Orderly Currencies