更多关于变革和相关问题
More on Change-Making and Related Problems
摘要:
给定一组$n$整数值硬币类型和目标值$t$,众所周知的找零问题要求总和为$t$的硬币的最小数量,假设每种类型中的硬币数量不受限制。在更一般的所有目标版本的问题中,我们希望对每个$j=0,\ldots,t$,最小数量的硬币和$j$。例如,教科书中的动态规划算法可以在$O(nt)$时间内解决所有目标问题。最近,Chan和He(SOSA'20)描述了一些用于改变问题的原始(单目标)版本的$O(t\,\textrm{polylog}\,t)$时间算法,但不是所有目标版本。我们获得了一些新的结果,对改变决策和相关问题,包括:1。提出了一种求解全目标变址问题的新算法--运行时算法$\tilde{O}(t^{4/3})$,改进了以前的$\tilde{O}(t^{3/2})$ -时间算法。2.一个非常简单的$\tilde{O}(u^2+t)$ -时间算法,用于所有目标改变决策问题,其中$u$表示最大硬币值。该算法的分析使用了Erdans和Graham(1972)关于Frobenius问题的定理。该算法可以扩展到解决所有容量版本的无界背包问题(整数项目的$u$有界的重量)。3.对于原来的(单目标)硬币变化的问题,我们描述了一个简单的修改陈和他的算法,运行在$\tilde{O}(u)$的时间(而不是$\tilde{O}(t)$)。4.对于原来的(单容量)无界背包问题,我们描述了一个简单的算法,运行在$\tilde{O}(nu)$时间,改善以前的近$u^2$时间算法。5.我们还观察到我们的一个想法如何暗示最小断字问题的一个新结果,这是Bringmann等人研究的字符串问题的优化版本。(FOCS'17),推广了变更(对应于一元特殊情况)。
英文摘要:
Given a set of $n$ integer-valued coin types and a target value $t$, the well-known change-making problem asks for the minimum number of coins that sum to $t$, assuming an unlimited number of coins in each type. In the more general all-targets version of the problem, we want the minimum number of coins summing to $j$, for every $j=0,\ldots,t$. For example, the textbook dynamic programming algorithms can solve the all-targets problem in $O(nt)$ time. Recently, Chan and He (SOSA'20) described a number of $O(t\,\textrm{polylog}\,t)$-time algorithms for the original (single-target) version of the change-making problem, but not the all-targets version. We obtain a number of new results on change-making and related problems, including: 1. A new algorithm for the all-targets change-making problem with running time $\tilde{O}(t^{4/3})$, improving a previous $\tilde{O}(t^{3/2})$-time algorithm. 2. A very simple $\tilde{O}(u^2+t)$-time algorithm for the all-targets change-making problem, where $u$ denotes the maximum coin value. The analysis of the algorithm uses a theorem of Erdős and Graham (1972) on the Frobenius problem. This algorithm can be extended to solve the all-capacities version of the unbounded knapsack problem (for integer item weights bounded by $u$). 3. For the original (single-target) coin changing problem, we describe a simple modification of one of Chan and He's algorithms that runs in $\tilde{O}(u)$ time (instead of $\tilde{O}(t)$). 4. For the original (single-capacity) unbounded knapsack problem, we describe a simple algorithm that runs in $\tilde{O}(nu)$ time, improving previous near-$u^2$-time algorithms. 5. We also observe how one of our ideas implies a new result on the minimum word break problem, an optimization version of a string problem studied by Bringmann et al. (FOCS'17), generalizing change-making (which corresponds to the unary special case).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。