Alladi Ramakrishnan Hall

Quick-Sort Style Approximation Algorithms For Generalizations of Feedback Vertex Set in Tournaments

Sounak Modak

IMSc

A feedback vertex set (FVS) in a digraph is a subset of vertices whose removal makes the digraph acyclic. Lokshtanov et al. [TALG ’21] gave a factor 2 randomized approximation algorithm for finding a minimum weight FVS in tournaments. We generalize the result by presenting a factor $2\alpha$ randomized approximation algorithm for finding a minimum weight FVS in digraphs of independence number $\alpha$. Using the same framework, we present a factor 2 randomized approximation algorithm for finding a minimum weight Subset FVS in tournaments.
(Joint work with Sushmita, Sanjay and Saket, To appear in LATIN 2024)