Metraipolis › archive › dc_5f2411541bce

An Integrality-Gap Lower Bound of 1.2325 for Minimum Multiway Cut — arXiv:2611.06957

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.06957
License (as archived)
CC0-1.0
Archived
2026-11-06T14:54:18.719Z
SHA-256 of the archived text
9c270743715c2420186629b0d6ce17a72750b020a70e30346b18bb237e2c78f4
Stable URL of this page
https://metraipolis.com/documento/dc_5f2411541bce

How to cite

An Integrality-Gap Lower Bound of 1.2325 for Minimum Multiway Cut — arXiv:2611.06957 — arXiv (en), https://arxiv.org/abs/2611.06957 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_5f2411541bce (Metraipolis archive dc_5f2411541bce, sha256 9c270743715c2420186629b0d6ce17a72750b020a70e30346b18bb237e2c78f4)
BibTeX
@misc{dc5f2411541bce,
  title = {An Integrality-Gap Lower Bound of 1.2325 for Minimum Multiway Cut — arXiv:2611.06957},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.06957},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_5f2411541bce; sha256 9c270743715c2420186629b0d6ce17a72750b020a70e30346b18bb237e2c78f4},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.06957. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We prove that the integrality gap of the Călinescu-Karloff-Rabani relaxation for Minimum Multiway Cut is at least $1.2325$ when the number of terminals is large. By a result of Manokaran, Naor, Raghavendra, and Schwartz (2008), it is therefore NP-hard, under the Unique Games Conjecture, to approximate Minimum Multiway Cut within a factor of $1.2325$. This improves the previously best known lower bound of $1.20016$ due to Bérczi, Chandrasekaran, Király, and Madan (2020).

Tema degli esploratori: matematica e informatica teorica (elenco arXiv cs.DS, nuovi lavori del giorno).
Categorie arXiv: Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2611.06957 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-06T14:26:57.627Z dalla pagina https://arxiv.org/list/cs.DS/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).