Totally greedy coin sets and greedy obstructions
From MaRDI portal
Publication:1010817
zbMath1165.05314MaRDI QIDQ1010817
Publication date: 7 April 2009
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/130275
change making algorithm; coin set; denominations; greedy coin set; greedy obstructions; initial subsequences; total greediness
68R05: Combinatorics in computer science
90C27: Combinatorial optimization
05A99: Enumerative combinatorics
Related Items
Combinatorics of the change-making problem, Change-making problems revisited: a parameterized point of view, Knapsack problems -- an overview of recent advances. I: Single knapsack problems, Characterization of canonical systems with six types of coins for the change-making problem, Unnamed Item