Fooling集与生成树多面体
Fooling Sets and the Spanning Tree Polytope
摘要:
在组合优化问题多面体扩张的研究中,一个著名的公开问题是关于具有$n$结点的完全图上最小生成树问题的最小扩张公式的大小.最著名的下界是$Ω(n^2)$,最著名的上界是$O(n^3)$。在本文中,我们证明了古老的愚弄集方法不能用来提高下界:每个愚弄集的生成树多面体的大小$O(n^2)$。
英文摘要:
In the study of extensions of polytopes of combinatorial optimization problems, a notorious open question is that for the size of the smallest extended formulation of the Minimum Spanning Tree problem on a complete graph with $n$ nodes. The best known lower bound is $Ω(n^2)$, the best known upper bound is $O(n^3)$. In this note we show that the venerable fooling set method cannot be used to improve the lower bound: every fooling set for the Spanning Tree polytope has size $O(n^2)$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。