eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2024-09-16
18:1
18:20
10.4230/LIPIcs.APPROX/RANDOM.2024.18
article
A Constant Factor Approximation for Directed Feedback Vertex Set in Graphs of Bounded Genus
Sun, Hao
1
https://orcid.org/0000-0002-2000-8080
University of Alberta, 116 St & 85 Ave, Edmonton, AB T6G 2R3, Canada
The minimum directed feedback vertex set problem consists in finding the minimum set of vertices that should be removed in order to make a directed graph acyclic. This is a well-known NP-hard optimization problem with applications in various fields, such as VLSI chip design, bioinformatics and transaction processing deadlock prevention and node-weighted network design. We show a constant factor approximation for the directed feedback vertex set problem in graphs of bounded genus.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol317-approx-random2024/LIPIcs.APPROX-RANDOM.2024.18/LIPIcs.APPROX-RANDOM.2024.18.pdf
Feedback Vertex Set
Combinatorial Optimization
Approximation Algorithms
min-max relation
linear programming