Trigonometric approximation of the Max-Cut Polytope is star-like
Optimization and Control
2022-02-04 v1
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.
Keywords
Cite
@article{arxiv.2107.00574,
title = {Trigonometric approximation of the Max-Cut Polytope is star-like},
author = {Romain Ageron},
journal= {arXiv preprint arXiv:2107.00574},
year = {2022}
}
Comments
3 pages, 0 figures