求解变商问题的标准硬币系统
Canonical Coin Systems for Change-Making Problems
摘要:
找零问题是在给定的硬币系统下用最少的硬币来表示给定的价值。作为背包问题的一个变种,它被认为是NP-困难的。然而,在大多数真实货币系统中,贪心算法产生最优解。在本文中,我们研究什么类型的硬币系统,保证最优的贪心算法。我们分别证明了具有四种或五种硬币的所谓\emph{canonical}硬币系统的一个充分必要条件和非正则硬币系统的一个充分条件.此外,我们提出了一个$O(m^2)$算法,决定是否紧硬币系统是规范的。
英文摘要:
The Change-Making Problem is to represent a given value with the fewest coins under a given coin system. As a variation of the knapsack problem, it is known to be NP-hard. Nevertheless, in most real money systems, the greedy algorithm yields optimal solutions. In this paper, we study what type of coin systems that guarantee the optimality of the greedy algorithm. We provide new proofs for a sufficient and necessary condition for the so-called \emph{canonical} coin systems with four or five types of coins, and a sufficient condition for non-canonical coin systems, respectively. Moreover, we present an $O(m^2)$ algorithm that decides whether a tight coin system is canonical.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。