Given a subset of cycles of a graph, we consider the problem of finding a minimum-weight set of vertices that meets all cycles in the subset. This problem generalizes a number of problems, including the minimum-weight feedback vertex set problem in both directed and undirected graphs, the subset feedback vertex set problem, and the graph bipartization problem, in which one must remove a minimum-weight set of vertices so that the remaining graph is bipartite. We give a (formula presented) approximation algorithm for the general problem in planar graphs, given that the subset of cycles obeys certain properties. This results in (formula presented) approximation algorithms for the aforementioned feedback and bipartization problems in planar graphs. Our algorithms use the primaldual method for approximation algorithms as given in Goemans and Williamson [14]. We also show that our results have an interesting bearing on a conjecture of Akiyama and Watanabe [2] on the cardinality of feedback vertex sets in planar graphs.
CITATION STYLE
Goemans, M. X., & Williamson, D. P. (1996). Primal-dual approximation algorithms for feedback problems in planar graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1084, pp. 147–161). Springer Verlag. https://doi.org/10.1007/3-540-61310-2_12
Mendeley helps you to discover research relevant for your work.