Author

Neng Huang

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Oct 2026

Optimal Algorithms and Hardness for Max-Cut in Bounded Degree Graphs

This work gives a polynomial-time algorithm that achieves an $\alpha_{GW} + \tilde{\Omega}(1/d)$-approximation for Max 2-LIN(2) in weighted instances where each vertex appears in at most $d$ constraints and shows a matching Unique Games hardness under randomized polynomial-time reductions.

Rares-Darius Buhai, Suprovat Ghoshal, Neng Huang et al. · 0 citations