Quick-sort style approximation algorithms for generalizations of feedback vertex set in tournaments

DOI10.1007/978-3-031-55598-5_15MaRDI QIDQ6547935zbMATH OpenFDO

Authors Sushmita Gupta, Sounak Modak, Saket Saurabh, Sanjay Seetharaman

Publication date 31 May 2024

Full work available at URL https://doi.org/10.1007/978-3-031-55598-5_15

Mathematics Subject Classification ID

Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cites work

• 2-Approximating Feedback Vertex Set in Tournaments
• A 7/3-approximation for feedback vertex sets in tournaments
• An approximation algorithm for feedback vertex sets in tournaments
• Edge-disjoint paths in digraphs with bounded independence number
• scientific article; zbMATH DE number 7646025 (Why is no real title available?)
• scientific article; zbMATH DE number 7650395 (Why is no real title available?)
• Vertex cover might be hard to approximate to within \(2 - \varepsilon \)

Cited in

(2)

• Subset feedback vertex set in tournaments as fast as without the subset
• Subset feedback vertex set in tournaments as fast as without the subset

This page was built for publication: Quick-sort style approximation algorithms for generalizations of feedback vertex set in tournaments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6547935)