New valid inequalities and an ADMM cutting-plane algorithm improve SDP upper bounds on the size of the largest k-colorable induced subgraph, with polynomial-time solvability shown for k-perfect graphs.
(2021).l 2-box ADMM decoding for LDPC codes over ISI channels.IEEE Transactions on Vehicular Technology, 70(4):3966–3971
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Improved semidefinite programming bounds for the maximum $k$-colorable subgraph problem
New valid inequalities and an ADMM cutting-plane algorithm improve SDP upper bounds on the size of the largest k-colorable induced subgraph, with polynomial-time solvability shown for k-perfect graphs.