23 citations · 146 across the 41 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
cs.DS2026
Sharper Gaussian Covers in the Bansal--Huang--Lee Coloring Framework
Konstantin Makarychev, Yury Makarychev
Bansal, Huang, and Lee recently gave a polynomial-time algorithm that colors every -colorable graph on vertices with colors. We improve their bound to $O(n^…
cs.DS2026
Threshold Rounding and Bounded-Degree Boolean MAX 2-CSP
Suprovat Ghoshal, Neng Huang, Euiwoong Lee +2
We describe an -improvement over threshold rounding schemes for a broad class of Boolean MAX 2-CSP instances in which every variable appears in at most cons…