Year: 2020
Type: preprint
Abstract: We show that performing just one round of the Sherali-Adams hierarchy gives an easy 7/3-approximation algorithm for the Feedback Vertex Set (FVST) problem in tournaments. This matches the best deterministic approximation algorithm for FVST due to Mnich, Williams, and Végh, and is a significant simplification and runtime improvement of their approach.
Source: arXiv (Cornell University)
Institutions: Université Libre de Bruxelles, Monash University
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Award: G1541951022
OpenAlex ID: W3067474126