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

A feedback vertex set (FVS) in a digraph is a subset of vertices whose removal makes the digraph acyclic. In other words, it hits all cycles in the digraph. Lokshtanov et al. [TALG '21] gave a factor 2 randomized approximation algorithm for finding a minimum weight FVS in tournaments. We genera...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2024-02
Hauptverfasser:	Gupta, Sushmita, Modak, Sounak, Saket Saurabh, Seetharaman, Sanjay
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Apexes Approximation Feedback Graph theory Mathematical analysis Minimum weight Vertex sets
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!