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

约束指派问题的一个拟多项式逼近

A Quasi-Polynomial Approximation for the Restricted Assignment Problem

Klaus Jansen, Lars Rohwedder

摘要:

受限指派问题是并行不相关机器排序问题的一个重要特例。对于已知最强的线性规划松弛,配置LP,我们提高了其完整性差距的非建设性界从1.9142到1.8334,并显着简化证明。然后我们给出了一个构造性的变体,在准多项式时间内得到了1.8334-近似。这是第一个准多项式算法,这个问题的改善长期存在的近似率为2。

英文摘要:

The Restricted Assignment Problem is a prominent special case of Scheduling on Parallel Unrelated Machines. For the strongest known linear programming relaxation, the configuration LP, we improve the non-constructive bound on its integrality gap from 1.9142 to 1.8334 and significantly simplify the proof. Then we give a constructive variant, yielding a 1.8334-approximation in quasi-polynomial time. This is the first quasi-polynomial algorithm for this problem improving on the long-standing approximation rate of 2.

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

↑