A simple 7/3-approximation algorithm for feedback vertex set in tournaments

08/20/2020
by   Manuel Aprile, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/22/2018

A 2-Approximation Algorithm for Feedback Vertex Set in Tournaments

A tournament is a directed graph T such that every pair of vertices is ...
research
04/21/2018

Designing Practical PTASes for Minimum Feedback Vertex Set in Planar Graphs

We present two algorithms for the minimum feedback vertex set problem in...
research
04/20/2021

Locally Private k-Means in One Round

We provide an approximation algorithm for k-means clustering in the one-...
research
04/30/2018

A Linear-Time Approximation Algorithm for the Orthogonal Terrain Guarding Problem

In this paper, we consider the 1.5-dimensional orthogonal terrain guardi...
research
09/23/2020

A simple (2+ε)-approximation algorithm for Split Vertex Deletion

A split graph is a graph whose vertex set can be partitioned into a cliq...
research
05/29/2019

Improved Analysis of Highest-Degree Branching for Feedback Vertex Set

Recent empirical evaluations of exact algorithms for Feedback Vertex Set...
research
11/07/2018

Election with Bribed Voter Uncertainty: Hardness and Approximation Algorithm

Bribery in election (or computational social choice in general) is an im...

Please sign up or login with your details

Forgot password? Click here to reset