arXiv (All)
open access
An iterative rounding $2$-approximation for Feedback Vertex Set via AI-assisted proof of an extreme point property
We consider the Feedback Vertex Set problem (FVS): the input is an undirected graph $G=(V,E)$ and the goal is to find a minimum-cardinality (or a min-cost in the weighted case) subset $S \subseteq V$ of vertices such that $G-S$ has no cycles. A $2$-approximation via the local-ratio method was develo
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
- Minimum Sum Vertex Cover via Minimum Vertex Cover#1063328
- Fort Abundance in Zero Forcing#999442
- A Proof of the Imbalance Conjecture#615165
- A Proof of the Imbalance Conjecture#614198
- An Optimal Bound for Ramsey Goodness of Cycles#799017
Record · ID 927704
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