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 optimizat...
Saved in:
| Published in: | Discrete analysis |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Alliance of Diamond Open Access Journals
05.08.2020
|
| ISSN: | 2397-3129 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!