最大割多面体的三角逼近是星形的
Trigonometric approximation of the Max-Cut Polytope is star-like
摘要：
最大割多胞形出现在许多困难的组合最优化问题的表述中。这些问题也可以用公式表示为所谓的三角逼近上的最优化问题，三角逼近具有算法上可访问的描述，但不是凸的。赫希菲尔德指出，这种三角逼近是星形的。在这篇文章中，我们提供了一个证明这个猜想。
英文摘要：
The Max-Cut polytope appears in the formulation of many difficult combinatorial optimization problems. These problems can also be formulated as optimization problems over the so-called trigonometric approximation which possesses an algorithmically accessible description but is not convex. Hirschfeld conjectured that this trigonometric approximation is star-like. In this article, we provide a proof of this conjecture.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
