SDP techniques bound fractional cut-cover and MAX 2-SAT on association scheme graphs and distance-regular graphs, extending Goemans-Williamson equality cases and computing gauge duals.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Semidefinite programming bounds on fractional cut-cover and maximum 2-SAT for highly regular graphs
SDP techniques bound fractional cut-cover and MAX 2-SAT on association scheme graphs and distance-regular graphs, extending Goemans-Williamson equality cases and computing gauge duals.