线性规划顶点覆盖问题计算难度的大偏差性质
Large-deviation Properties of Linear-programming Computational Hardness of the Vertex Cover Problem
摘要:
利用稀疏事件抽样方法,研究了Erdos-Renyi随机图顶点覆盖问题线性规划松弛算法的计算代价分布。作为一个大偏差的属性,“容易”和“困难”的问题的分布的差异被发现反映LP松弛近似的硬度。特别是,通过评估总的变化距离之间的条件分布相对于硬度,它建议,这些分布几乎是不可区分的副本对称(RS)阶段,而他们渐近不同的复本对称性破缺(RSB)阶段。此外,我们寻求通过调查的相似性,二分图,这表现出定量的RS和RSB阶段之间的差异图结构的关系。这些结果表明,在相应的随机图形结构的自旋玻璃理论模型的RS-RSB相变的LP松弛的典型的计算成本的非平凡的关系。
英文摘要:
The distribution of the computational cost of linear-programming (LP) relaxation for vertex cover problems on Erdos-Renyi random graphs is evaluated by using the rare-event sampling method. As a large-deviation property, differences of the distribution for "easy" and "hard" problems are found reflecting the hardness of approximation by LP relaxation. In particular, by evaluating the total variation distance between conditional distributions with respect to the hardness, it is suggested that those distributions are almost indistinguishable in the replica symmetric (RS) phase while they asymptotically differ in the replica symmetry breaking (RSB) phase. In addition, we seek for a relation to graph structure by investigating a similarity to bipartite graphs, which exhibits a quantitative difference between the RS and RSB phase. These results indicate the nontrivial relation of the typical computational cost of LP relaxation to the RS-RSB phase transition as present in the spin-glass theory of models on the corresponding random graph structure.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。