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

带序替换的集合覆盖--加性和乘性间隙

Set Covering with Ordered Replacement -- Additive and Multiplicative Gaps

Friedrich Eisenbrand, Naonori Kakimura, Thomas Rothvoß, Laura Sanità

摘要:

我们考虑集合覆盖问题的基础集系统满足一个特定的替换属性w.r.t.元素的给定偏序:只要一个集合在集合系统中,那么通过用一个更小的元素替换一个元素而产生的集合也在集合系统中。文献中出现的许多变式的装箱问题都是这样的有序替换的集合覆盖问题。本文给出了带替换的集合覆盖的加法和乘法完整性缺口以及可逼近性的严格解释。特别是,我们提供了一个多对数上界的添加剂的完整性差距,也产生一个多项式时间的添加剂近似算法,如果线性规划松弛可以有效地解决。此外,我们提出了一个广泛的列表覆盖的问题,落入我们的框架,因此有多对数添加剂的差距以及。

英文摘要:

We consider set covering problems where the underlying set system satisfies a particular replacement property w.r.t. a given partial order on the elements: Whenever a set is in the set system then a set stemming from it via the replacement of an element by a smaller element is also in the set system. Many variants of BIN PACKING that have appeared in the literature are such set covering problems with ordered replacement. We provide a rigorous account on the additive and multiplicative integrality gap and approximability of set covering with replacement. In particular we provide a polylogarithmic upper bound on the additive integrality gap that also yields a polynomial time additive approximation algorithm if the linear programming relaxation can be efficiently solved. We furthermore present an extensive list of covering problems that fall into our framework and consequently have polylogarithmic additive gaps as well.

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

↑