arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1311.4563cs.DS
收藏

增量背包问题的选言规划近似算法

Approximation Algorithms for the Incremental Knapsack Problem via Disjunctive Programming

Daniel Bienstock, Jay Sethuraman, Chun Ye

摘要:

在增量背包问题($\IK$)中,我们给出了一个背包,其容量作为时间的函数弱增长。存在$T$周期的时间范围,并且背包的容量是对于$t = 1, \ldots, T$的周期$t$中的$B_t$。我们还得到了一套$S$的$N$项目放置在背包。项目$i$的值为$v_i$,权重为$w_i$,与时间段无关。在任何时间段$t$,背包中物品的重量之和不能超过背包容量$B_t$。此外,一旦物品被放置在背包中,它就不能在稍后的时间段从背包中取出。我们寻求最大化的总和(折扣)背包价值随着时间的推移受到的能力限制。我们首先给出了$\IK$的常数因子近似算法,在对$B_t$的增长率的温和限制下(常数因子依赖于增长率)。然后,我们给出了一个PTAS $\IIK$,$\IK$的特殊情况下,没有折扣,当$T = O(\sqrt{\log N})$。

英文摘要:

In the incremental knapsack problem ($\IK$), we are given a knapsack whose capacity grows weakly as a function of time. There is a time horizon of $T$ periods and the capacity of the knapsack is $B_t$ in period $t$ for $t = 1, \ldots, T$. We are also given a set $S$ of $N$ items to be placed in the knapsack. Item $i$ has a value of $v_i$ and a weight of $w_i$ that is independent of the time period. At any time period $t$, the sum of the weights of the items in the knapsack cannot exceed the knapsack capacity $B_t$. Moreover, once an item is placed in the knapsack, it cannot be removed from the knapsack at a later time period. We seek to maximize the sum of (discounted) knapsack values over time subject to the capacity constraints. We first give a constant factor approximation algorithm for $\IK$, under mild restrictions on the growth rate of $B_t$ (the constant factor depends on the growth rate). We then give a PTAS for $\IIK$, the special case of $\IK$ with no discounting, when $T = O(\sqrt{\log N})$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑