A 7/3-approximation for feedback vertex sets in tournaments

Mnich, Matthias, Williams, Virginia Vassilevska and Végh, László A. ORCID: 0000-0003-1152-200X (2016) A 7/3-approximation for feedback vertex sets in tournaments. Leibniz International Proceedings in Informatics (57). 67:1-67:14. ISSN 1868-8969

Preview

PDF - Published Version Available under License Creative Commons Attribution. Download (728kB) | Preview

• Author

Abstract

We consider the minimum-weight feedback vertex set problem in tournaments: given a tournament with non-negative vertex weights, remove a minimum-weight set of vertices that intersects all cycles. This problem is NP-hard to solve exactly, and Unique Games-hard to approximate by a factor better than 2. We present the first 7/3 approximation algorithm for this problem, improving on the previously best known ratio 5/2 given by Cai et al. [FOCS 1998, SICOMP 2001].

Item Type:	Article
Official URL:	http://www.dagstuhl.de/publikationen/lipics/
Additional Information:	© 2016 The Authors © CC BY 4.0
Divisions:	Mathematics
Subjects:	Q Science > QA Mathematics
Date Deposited:	06 Mar 2017 16:18
Last Modified:	17 Oct 2024 16:03
Projects:	306465, CCF-1417238, CCF-1528078, CCF-1514339, BSF:2012338, EP/M02797X/1
Funders:	European Research Council, National Science Foundation, National Science Foundation, National Science Foundation, U.S.-Israel Binational Science Foundation, Engineering and Physical Sciences Research Council
URI:	http://eprints.lse.ac.uk/id/eprint/69648

Actions (login required)

View Item