Metraipolis › archive › dc_7e48ee1ac3f2

Polynomial Kernels for Interval Completion — arXiv:2610.10319

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.10319
License (as archived)
CC0-1.0
Archived
2026-10-08T12:49:46.378Z
SHA-256 of the archived text
b374b3200365280ec965b892c5b9307f06971c6f643d0828074fc6c5d5c5aa77
Stable URL of this page
https://metraipolis.com/documento/dc_7e48ee1ac3f2

How to cite

Polynomial Kernels for Interval Completion — arXiv:2610.10319 — arXiv (en), https://arxiv.org/abs/2610.10319 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7e48ee1ac3f2 (Metraipolis archive dc_7e48ee1ac3f2, sha256 b374b3200365280ec965b892c5b9307f06971c6f643d0828074fc6c5d5c5aa77)
BibTeX
@misc{dc7e48ee1ac3f2,
  title = {Polynomial Kernels for Interval Completion — arXiv:2610.10319},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.10319},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7e48ee1ac3f2; sha256 b374b3200365280ec965b892c5b9307f06971c6f643d0828074fc6c5d5c5aa77},
  year = {2026}
}

Archived text

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

An interval graph is the intersection graph of a family of intervals on the real line. \textsc{Interval Completion} asks whether a given graph can be transformed into an interval graph by adding at most $k$ edges. Although the problem is fixed-parameter tractable when parameterized by $k$, whether it admits a polynomial kernel has long been an open question. We resolve this question by giving the first polynomial kernel for \textsc{Interval Completion}. Our main contribution is a parameter-preserving polynomial-time reduction from \textsc{Interval Completion} to \textsc{Odd Cycle Transversal} (OCT). Combining this reduction with the known randomized and deterministic polynomial kernels for OCT and a polynomial-time reduction back to \textsc{Interval Completion}, we obtain a randomized kernel with $\widetilde O(k^{18})$ vertices and $\widetilde O(k^{36})$ edges, and a deterministic kernel with $O(k^{36})$ vertices and $O(k^{72})$ edges. Here, $\widetilde O$ suppresses polylogarithmic factors in $k$.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv cs.DS, nuovi lavori del giorno).
Categorie arXiv: Data Structures and Algorithms (cs.DS) ; Computational Complexity (cs.CC).
Pagina del lavoro: https://arxiv.org/abs/2610.10319 — 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-10-08T12:19:30.207Z dalla pagina https://arxiv.org/list/cs.DS/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).