arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1801.07937cs.DMcs.CC
收藏

色彩搭配的完整性间隙

Integrality Gaps for Colorful Matchings

Steven Kelk, Georgios Stamoulis

摘要:

研究了自然线性规划松弛算法在求解\textit{Bounded Color Matching}(正整数)问题时的完整性缺口。我们提供了几个家庭的实例,并建立其完整性差距的下限,我们研究如何Sherali亚当斯“升降机和项目”技术在这些情况下的行为。我们补充这些结果表明,如果我们排除某些简单的子结构,从我们的输入图,那么完整性差距的自然线性制定严格改善。为了证明这一点,我们将Füredi [ \emph{Combinatorica},1(2):155-162,1981]的结果用于我们的目的。我们进一步利用这一点,以显示上界的Sherali-Adams层次结构的性能时,适用于自然LP松弛的问题。

英文摘要:

We study the integrality gap of the natural linear programming relaxation for the \textit{Bounded Color Matching} (BCM) problem. We provide several families of instances and establish lower bounds on their integrality gaps and we study how the Sherali-Adams "lift-and-project" technique behaves on these instances. We complement these results by showing that if we exclude certain simple sub-structures from our input graphs, then the integrality gap of the natural linear formulation strictly improves. To prove this, we adapt for our purposes the results of Füredi [\emph{Combinatorica}, 1(2):155-162, 1981]. We further leverage this to show upper bounds on the performance of the Sherali-Adams hierarchy when applied to the natural LP relaxation of the BCM problem.

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

↑