arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2004.05954cs.DSmath.OC
收藏

最小和序问题的一般近似框架

A General Framework for Approximating Min Sum Ordering Problems

Felix Happach, Lisa Hellerstein, Thomas Lidbetter

摘要:

我们考虑一个大家庭的问题,其中的顺序(或更准确地说,一个链的子集)的有限集必须选择一些加权和成本最小化。这个家庭包括最小和集覆盖(MSSC)的变化,几个调度和搜索问题,以及布尔函数求值问题。我们定义了一个新的问题,称为最小和排序问题(MSOP),它概括了所有这些问题,使用有限集的子集上定义的成本和权重函数。假设一个多项式时间的$α$ -近似算法的问题,找到一个子集的重量比成本是最大的,我们表明,在非常小的假设下,有一个多项式时间的$4 α$ -近似算法MSOP。这种近似结果推广了文献中几个不同问题的证明技术。我们应用这一点,以获得一些新的近似结果。

英文摘要:

We consider a large family of problems in which an ordering (or, more precisely, a chain of subsets) of a finite set must be chosen to minimize some weighted sum of costs. This family includes variations of Min Sum Set Cover (MSSC), several scheduling and search problems, and problems in Boolean function evaluation. We define a new problem, called the Min Sum Ordering Problem (MSOP) which generalizes all these problems using a cost and a weight function defined on subsets of a finite set. Assuming a polynomial time $α$-approximation algorithm for the problem of finding a subset whose ratio of weight to cost is maximal, we show that under very minimal assumptions, there is a polynomial time $4 α$-approximation algorithm for MSOP. This approximation result generalizes a proof technique used for several distinct problems in the literature. We apply this to obtain a number of new approximation results.

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

↑