Approximating max-cut on bounded degree graphs: tighter analysis of the FKL algorithm

From MaRDI portal

Jump to:navigation, search

DOI10.4230/LIPICS.ICALP.2023.77MaRDI QIDQ6638080zbMATH OpenFDO

Authors Jun-Ting Hsieh, Pravesh Kothari

Publication date 14 November 2024

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2023.77

zbMATH Keywords

approximation algorithm max-cut semidefinite programming

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cited in

(1)

Triangles improve 0.878 approximation for Maxcut

This page was built for publication: Approximating max-cut on bounded degree graphs: tighter analysis of the FKL algorithm

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Approximating_max-cut_on_bounded_degree_graphs:_tighter_analysis_of_the_FKL_algorithm&oldid=103939496"