arXiv (OAI Expanded)
open access
A Deterministic $(2+\varepsilon)$-Approximation for Weighted Feedback Vertex Set in Tournaments
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 $\var
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Unfair Sampling of Quantum Annealing in Weighted Graph Bipartitioning Problems#670559
- Unfair Sampling of Quantum Annealing in Weighted Graph Bipartitioning Problems#668494
- Weighted lattice point enumeration in lecture hall order polytopes#1123629
- A proof of Hare's $ε$ unfair conjecture#986985
- Min-Sum Set Cover on Parallel Machines#1141517
Record · ID 1109265
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive