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...
Uložené v:
| Vydané v: | Discrete analysis |
|---|---|
| Hlavní autori: | , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Alliance of Diamond Open Access Journals
05.08.2020
|
| ISSN: | 2397-3129 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
Buďte prvý, kto okomentuje tento záznam!