arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2202.10904cs.DScs.DMmath.COmath.OC
收藏

近似正合箱覆盖问题

The near exact bin covering problem

Asaf Levin

摘要:

我们提出了一个新的推广的箱覆盖问题,这是已知的是一个强NP-困难的问题。在我们的推广中,有一个正的常数$Δ$,并且我们给出了一组项,每个项都有一个正的大小。我们想找个地方把这些东西分到箱子里。我们说一个箱子是接近精确覆盖,如果项目的总大小装进箱子是在$1$和$1+Δ$之间。我们的目标是最大化接近精确覆盖的箱子的数量。如果$Δ=0$或$Δ>0$作为输入的一部分,我们的问题在这里被证明没有近似算法与有界渐近近似比(假设$P\neq NP$)。然而,对于$Δ>0$被视为一个常数的情况下,我们提出了一个渐进的完全多项式时间近似计划(AFPTAS),这是我们的主要贡献。

英文摘要:

We present a new generalization of the bin covering problem that is known to be a strongly NP-hard problem. In our generalization there is a positive constant $Δ$, and we are given a set of items each of which has a positive size. We would like to find a partition of the items into bins. We say that a bin is near exact covered if the total size of items packed into the bin is between $1$ and $1+Δ$. Our goal is to maximize the number of near exact covered bins. If $Δ=0$ or $Δ>0$ is given as part of the input, our problem is shown here to have no approximation algorithm with a bounded asymptotic approximation ratio (assuming that $P\neq NP$). However, for the case where $Δ>0$ is seen as a constant, we present an asymptotic fully polynomial time approximation scheme (AFPTAS) that is our main contribution.

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

↑