An Improved Integrality Gap for the Calinescu-Karloff-Rabani Relaxation for Multiway Cut
Haris Angelidakis, Yury Makarychev, Pasin Manurangsi

TL;DR
This paper presents a new integrality gap instance for the Multiway Cut LP relaxation, achieving a better ratio than previous bounds for multiple terminals, and links this to hardness of approximation results.
Contribution
It constructs an improved integrality gap for the Multiway Cut LP relaxation, surpassing previous bounds and establishing new hardness of approximation results.
Findings
New integrality ratio of 6/(5+1/(k-1)) - ε for k ≥ 3
Improves upon the previous lower bound of 8/(7+1/(k-1)) for k ≥ 4
Establishes Unique Games hardness for approximating Multiway Cut at this ratio
Abstract
We construct an improved integrality gap instance for the Calinescu-Karloff-Rabani LP relaxation of the Multiway Cut problem. In particular, for terminals, our instance has an integrality ratio of , for every constant . For every , our result improves upon a long-standing lower bound of by Freund and Karloff (2000). Due to Manokaran et al.'s result (2008), our integrality gap also implies Unique Games hardness of approximating Multiway Cut of the same ratio.
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.
Taxonomy
TopicsComplexity and Algorithms in Graphs · Advanced Graph Theory Research · Optimization and Search Problems
