Subexponential LPs approximate max-cut

DOI10.1109/FOCS46700.2020.00092MaRDI QIDQ6943963zbMATH OpenFDO

Authors Samuel B. Hopkins, Tselil Schramm, Luca Trevisan

Publication date 12 August 2025

Full work available at URL https://doi.org/10.1109/FOCS46700.2020.00092

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cited in

(1)

• A primal-dual extension of the Goemans-Williamson algorithm for the weighted fractional cut-covering problem

This page was built for publication: Subexponential LPs approximate max-cut

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6943963)