Grothendieck-type inequalities in combinatorial optimization
Subhash Khot, Assaf Naor
TL;DR
This paper surveys how Grothendieck inequalities relate to combinatorial optimization problems and their computational complexity, highlighting their theoretical significance and applications.
Contribution
It provides a comprehensive overview of the connections between Grothendieck inequalities and combinatorial optimization, emphasizing recent developments.
Findings
Grothendieck inequalities have deep implications in optimization.
Variants of these inequalities influence computational complexity results.
The survey summarizes key applications in combinatorial problems.
Abstract
We survey connections of the Grothendieck inequality and its variants to combinatorial optimization and computational complexity.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.