Totally greedy coin sets and greedy obstructions

zbMath1165.05314MaRDI QIDQ1010817

J. Martínez

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

zbMATH Keywords

change making algorithmcoin setdenominationsgreedy coin setgreedy obstructionsinitial subsequencestotal greediness

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Combinatorial optimization (90C27) Enumerative combinatorics (05A99)

Related Items

Unnamed Item ⋮ Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ Change-making problems revisited: a parameterized point of view ⋮ Characterization of canonical systems with six types of coins for the change-making problem ⋮ Combinatorics of the change-making problem