Deleting k colors to place the residual augmented graph in a uniformly rank-r exact hereditary class yields Lasserre exactness at level k+r, with color-intersection graphs inducing clique-sum locality for blockwise algorithms on rainbow matching.
Integrality gaps of linear and semi-definite programming relaxations for knapsack
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Grouped Color Deletion, Lasserre Exactness and Clique-Sum Locality for Rainbow Matching
Deleting k colors to place the residual augmented graph in a uniformly rank-r exact hereditary class yields Lasserre exactness at level k+r, with color-intersection graphs inducing clique-sum locality for blockwise algorithms on rainbow matching.