Metraipolis › archive › dc_d8737ddb2b8d

A Deterministic $(2+\varepsilon)$-Approximation for Weighted Feedback Vertex Set in Tournaments — arXiv:2609.15220

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.15220
License (as archived)
CC0-1.0
Archived
2026-10-16T02:15:30.959Z
SHA-256 of the archived text
37b373ecae09e375d951c2bbc780f0f6376f81866bacabddff640bd528c8a4ed
Stable URL of this page
https://metraipolis.com/documento/dc_d8737ddb2b8d

How to cite

A Deterministic $(2+\varepsilon)$-Approximation for Weighted Feedback Vertex Set in Tournaments — arXiv:2609.15220 — arXiv (en), https://arxiv.org/abs/2609.15220 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d8737ddb2b8d (Metraipolis archive dc_d8737ddb2b8d, sha256 37b373ecae09e375d951c2bbc780f0f6376f81866bacabddff640bd528c8a4ed)
BibTeX
@misc{dcd8737ddb2b8d,
  title = {A Deterministic $(2+varepsilon)$-Approximation for Weighted Feedback Vertex Set in Tournaments — arXiv:2609.15220},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.15220},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d8737ddb2b8d; sha256 37b373ecae09e375d951c2bbc780f0f6376f81866bacabddff640bd528c8a4ed},
  year = {2026}
}

Archived text

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

We study the weighted feedback vertex set problem in tournaments. For every fixed integer $k\geq 2$, we give a deterministic $(2+1/k)$-approximation algorithm with running time $n^{2^{O(k)}}$, apart from polynomial dependence on the encoding length of the weights. Consequently, for every fixed $\varepsilon>0$, weighted feedback vertex set in tournaments has a deterministic $(2+\varepsilon)$-approximation running in time $n^{2^{O(1/\varepsilon)}}$. The algorithm combines two ingredients. When the triangle graph of the tournament has bounded clique number, a chain decomposition of its transitive complement yields an exact dynamic program for a maximum-weight transitive subtournament. When the clique number is large, a structural theorem for triangle graphs supplies a constant-size strongly good cost vector. A local-ratio reduction with this cost vector gives the claimed guarantee. As a by-product, the dynamic program solves weighted feedback vertex set exactly in $\mathcal B_7$-free tournaments in time $O(n^7)$, where $\mathcal B_7$ is the family of seven-vertex tournaments with feedback vertex set number at least three.

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