Mnich, MatthiasMatthiasMnichVassilevska Williams, VirginiaVirginiaVassilevska WilliamsVégh, Lászlo A.Lászlo A.Végh2020-01-242020-01-24201624th Annual European Symposium on Algorithms (ESA 2016)http://hdl.handle.net/11420/4573We 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].enInformatikConference Paper10.4230/LIPIcs.ESA.2016.671511.01137Other