Trigonometric approximation of the Max-Cut Polytope is star-like
arXiv:2107.00574 · doi:10.1007/s11590-021-01842-w
Abstract
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.
3 pages, 0 figures