arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1201.6090cs.DScs.DC
收藏

混合填充覆盖半定规划的并行近似算法

A parallel approximation algorithm for mixed packing and covering semidefinite programs

Rahul Jain, Penghui Yao

摘要:

对一类混合填充和覆盖半定规划问题提出了一种并行近似算法,该算法推广了Jain和Yao [2011]所考虑的半正定规划问题.作为推论,我们得到了一个更快的近似算法的半正定程序与更好的依赖于并行运行时间的近似因子,相比,Jain和姚[2011]。我们的算法和分析与Young [2001]的算法和分析类似,Young [2001]考虑了类似的线性规划。

英文摘要:

We present a parallel approximation algorithm for a class of mixed packing and covering semidefinite programs which generalize on the class of positive semidefinite programs as considered by Jain and Yao [2011]. As a corollary we get a faster approximation algorithm for positive semidefinite programs with better dependence of the parallel running time on the approximation factor, as compared to that of Jain and Yao [2011]. Our algorithm and analysis is on similar lines as that of Young [2001] who considered analogous linear programs.

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

↑