A 7/3-Approximation for Feedback Vertex Sets in Tournaments
From MaRDI portal
Publication:4606339
DOI10.4230/LIPIcs.ESA.2016.67zbMath1397.68226arXiv1511.01137OpenAlexW2962933009MaRDI QIDQ4606339
Matthias Mnich, László A. Végh, Virginia Vassilevska Williams
Publication date: 2 March 2018
Full work available at URL: https://arxiv.org/abs/1511.01137
Related Items
Improved bounds for minimal feedback vertex sets in tournaments, Improved approximation algorithms for hitting 3-vertex paths, Sub-exponential time parameterized algorithms for graph layout problems on digraphs with bounded independence number, A \(7 / 3\)-approximation algorithm for feedback vertex set in tournaments via Sherali-Adams, Ranking tournaments with no errors. I: Structural description, A tight approximation algorithm for the cluster vertex deletion problem, A tight approximation algorithm for the cluster vertex deletion problem, Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number, Triangle packing in (sparse) tournaments: approximation and kernelization, Tournaments and Semicomplete Digraphs