Lower bounds for max-cut via semidefinite programming

DOI10.1007/978-3-030-61792-9_38OpenAlexW3110578096MaRDI QIDQ2081648

Nitya Mani, Ray Li, Charles Carlson, Luca Trevisan, Alexandra Kolla, Benjamin Sudakov

Publication date: 13 October 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-61792-9_38

zbMATH Keywords

semidefinite programmingmax-cut\(K_r\)-free graphs

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)

Related Items (1)

Lower Bounds for Maximum Weighted Cut

This page was built for publication: Lower bounds for max-cut via semidefinite programming