A new single-SDP rounding method for Lovász theta that provably recovers maximum weighted stable sets in generalized split graphs and other perfect graph subclasses via value function approximation and dynamic programming.
SIAM Journal on Optimization 1(2), 166–190 (1991)
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
-
Rounding the Lov\'asz Theta Function with a Value Function Approximation
A new single-SDP rounding method for Lovász theta that provably recovers maximum weighted stable sets in generalized split graphs and other perfect graph subclasses via value function approximation and dynamic programming.