Characterization of canonical systems with six types of coins for the change-making problem

DOI10.1016/j.tcs.2023.113822OpenAlexW4324344277MaRDI QIDQ2697436

Ryuhei Miyashiro, Yuma Suzuki

Publication date: 12 April 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2111.12392

zbMATH Keywords

greedy algorithmcharacterizationknapsack problemcanonical systemchange-making problem

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Totally greedy coin sets and greedy obstructions
• Combinatorics of the change-making problem
• Optimal bounds for the change-making problem
• Change-making problems revisited: a parameterized point of view
• A polynomial-time algorithm for the change-making problem
• Discrete Dynamic Programming and Capital Allocation
• 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
• Algorithmic Solution of the Change-Making Problem

This page was built for publication: Characterization of canonical systems with six types of coins for the change-making problem