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.
Title resolution pending
2 Pith papers cite this work, alongside 1 external citations. Polarity classification is still indexing.
2
Pith papers citing it
1
external citations · external index
verdicts
UNVERDICTED 2representative citing papers
Displaced GBS enhances max-clique search success under loss or low squeezing and scales to large graphs with modest overhead.
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.
-
Displaced Gaussian Boson Sampling for enhanced max-clique search
Displaced GBS enhances max-clique search success under loss or low squeezing and scales to large graphs with modest overhead.