On the integrality gap of the maximum-cut semidefinite programming relaxation in fixed dimension
On the integrality gap of the maximum-cut semidefinite programming relaxation in fixed dimension, Discrete Analysis 2020:10, 17 pp. MAXCUT, the problem of finding a partition of the vertices of a given graph into two sets that maximizes the number of edges between the sets, is an important optimiza...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Diamond Open Access Journals
|
| Series: | Discrete Analysis |
| Online Access: | http://discrete-analysis.scholasticahq.com/article/14164-on-the-integrality-gap-of-the-maximum-cut-semidefinite-programming-relaxation-in-fixed-dimension.pdf |