An Improved Integrality Gap for the Calinescu-Karloff-Rabani Relaxation for Multiway Cut

November 17, 2016 Β· Declared Dead Β· πŸ› Conference on Integer Programming and Combinatorial Optimization

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Haris Angelidakis, Yury Makarychev, Pasin Manurangsi arXiv ID 1611.05530 Category cs.DS: Data Structures & Algorithms Citations 27 Venue Conference on Integer Programming and Combinatorial Optimization Last Checked 3 months ago
Abstract
We construct an improved integrality gap instance for the Calinescu-Karloff-Rabani LP relaxation of the Multiway Cut problem. In particular, for $k \geqslant 3$ terminals, our instance has an integrality ratio of $6 / (5 + \frac{1}{k - 1}) - \varepsilon$, for every constant $\varepsilon > 0$. For every $k \geqslant 4$, our result improves upon a long-standing lower bound of $8 / (7 + \frac{1}{k - 1})$ 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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Data Structures & Algorithms

Died the same way β€” πŸ‘» Ghosted