Metraipolis › archive › dc_39232b78b4bd

A Deterministic Polynomial Kernel for Odd Cycle Transversal — arXiv:2609.29141

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.29141
License (as archived)
CC0-1.0
Archived
2026-10-08T07:26:37.648Z
SHA-256 of the archived text
5216418e35747fe2706dcaec6694f496cd794b71876efab082d354fc18b2984e
Stable URL of this page
https://metraipolis.com/documento/dc_39232b78b4bd

How to cite

A Deterministic Polynomial Kernel for Odd Cycle Transversal — arXiv:2609.29141 — arXiv (en), https://arxiv.org/abs/2609.29141 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_39232b78b4bd (Metraipolis archive dc_39232b78b4bd, sha256 5216418e35747fe2706dcaec6694f496cd794b71876efab082d354fc18b2984e)
BibTeX
@misc{dc39232b78b4bd,
  title = {A Deterministic Polynomial Kernel for Odd Cycle Transversal — arXiv:2609.29141},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.29141},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_39232b78b4bd; sha256 5216418e35747fe2706dcaec6694f496cd794b71876efab082d354fc18b2984e},
  year = {2026}
}

Archived text

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

We give a deterministic polynomial kernel for Odd Cycle Transversal, derandomizing the randomized kernel of Kratsch and Wahlström (TALG 2014). Our algorithm uses a deterministic polynomial-time construction of almost multilinear representations of gammoids. Such a representation assigns a block of columns to each element so that, for every subset of elements, the normalized matrix rank approximates its matroid rank to within a prescribed additive error $\delta$. The construction builds on recent breakthroughs in NC algorithms for matching. Our kernelization algorithm then computes the required representative families from these representations.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-25 in cs.DS).
Categorie arXiv: Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2609.29141 — 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-08T06:44:29.081Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-09-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).