Abstract
Given a graph G and an integer k, the Feedback Vertex Set (FVS) problem asks if there is a vertex set T of size at most k that hits all cycles in the graph. Bodlaender (WG ’91) gave the first fixed-parameter algorithm for FVS in undirected graphs. The fixed-parameter tractability status of FVS in directed graphs was a long-standing open problem until Chen et al. (STOC ’08) showed that it is fixed-parameter tractable by giving an 4k k!n O(1) algorithm. In the subset versions of this problems, we are given an additional subset S of vertices (resp. edges) and we want to hit all cycles passing through a vertex of S (resp. an edge of S). Indeed both the edge and vertex versions are known to be equivalent in the parameterized sense. Recently the Subset Feedback Vertex Set in undirected graphs was shown to be FPT by Cygan et al. (ICALP ’11) and Kakimura et al. (SODA ’12). We generalize the result of Chen et al. (STOC ’08) by showing that Subset Feedback Vertex Set in directed graphs can be solved in time \(2^{2^{O(k)}}n^{O(1)}\), i.e., FPT parameterized by size k of the solution. By our result, we complete the picture for feedback vertex set problems and their subset versions in undirected and directed graphs.
The technique of random sampling of important separators was used by Marx and Razgon (STOC ’11) to show that Undirected Multicut is FPT and was generalized by Chitnis et al. (SODA ’12) to directed graphs to show that Directed Multiway Cut is FPT. In this paper we give a general family of problems (which includes Directed Multiway Cut and Directed Subset Feedback Vertex Set among others) for which we can do random sampling of important separators and obtain a set which is disjoint from a minimum solution and covers its “shadow”. We believe this general approach will be useful for showing the fixed-parameter tractability of other problems in directed graphs.
A full version of the paper is available at http://arxiv.org/pdf/1205.1271v1.pdf
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bafna, V., Berman, P., Fujito, T.: A 2-approximation algorithm for the undirected feedback vertex set problem. SIAM J. Discrete Math. 12(3), 289–297 (1999)
Becker, A., Bar-Yehuda, R., Geiger, D.: Randomized algorithms for the loop cutset problem. J. Artif. Intell. Res. (JAIR) 12, 219–234 (2000)
Bodlaender, H.L.: On disjoint cycles. In: WG, pp. 230–238 (1991)
Bonsma, P., Lokshtanov, D.: Feedback Vertex Set in Mixed Graphs. In: Dehne, F., Iacono, J., Sack, J.-R. (eds.) WADS 2011. LNCS, vol. 6844, pp. 122–133. Springer, Heidelberg (2011)
Cao, Y., Chen, J., Liu, Y.: On Feedback Vertex Set New Measure and New Structures. In: Kaplan, H. (ed.) SWAT 2010. LNCS, vol. 6139, pp. 93–104. Springer, Heidelberg (2010)
Chen, J., Fomin, F.V., Liu, Y., Lu, S., Villanger, Y.: Improved algorithms for feedback vertex set problems. J. Comput. Syst. Sci. 74(7), 1188–1198 (2008)
Chen, J., Liu, Y., Lu, S., O’Sullivan, B., Razgon, I.: A fixed-parameter algorithm for the directed feedback vertex set problem. In: STOC 2008, pp. 177–186 (2008)
Chitnis, R.H., Hajiaghayi, M., Marx, D.: Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset. In: SODA 2012, pp. 1713–1725 (2012)
Cygan, M., Kratsch, S., Pilipczuk, M., Pilipczuk, M., Wahlström, M.: Clique cover and graph separation: New incompressibility results. CoRR abs/1111.0570 (2011)
Cygan, M., Nederlof, J., Pilipczuk, M., Pilipczuk, M., van Rooij, J.M.M., Wojtaszczyk, J.O.: Solving connectivity problems parameterized by treewidth in single exponential time. In: FOCS 2011, pp. 150–159 (2011)
Cygan, M., Pilipczuk, M., Pilipczuk, M., Wojtaszczyk, J.O.: Subset Feedback Vertex Set is Fixed-Parameter Tractable. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol. 6755, pp. 449–461. Springer, Heidelberg (2011)
Downey, R.G., Fellows, M.R.: Parameterized Complexity, 530 p. Springer (1999)
Even, G., Naor, J., Schieber, B., Sudan, M.: Approximating Minimum Feedback Sets and Multi-Cuts in Directed Graphs (Extended Summary). In: IPCO 1995. LNCS, vol. 920, pp. 14–28. Springer, Heidelberg (1995)
Even, G., Naor, J., Zosin, L.: An 8-approximation algorithm for the subset feedback vertex set problem. SIAM J. Comput. 30(4), 1231–1252 (2000)
Flum, J., Grohe, M.: Parameterized Complexity Theory, 493 p. Springer (2006)
Kakimura, N., Kawarabayashi, K., Kobayashi, Y.: Erdös-pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing. In: SODA 2012, pp. 1726–1736 (2012)
Kanj, I.A., Pelsmajer, M.J., Schaefer, M.: Parameterized Algorithms for Feedback Vertex Set. In: Downey, R.G., Fellows, M.R., Dehne, F. (eds.) IWPEC 2004. LNCS, vol. 3162, pp. 235–247. Springer, Heidelberg (2004)
Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, pp. 85–103 (1972)
Kratsch, S., Wahlström, M.: Representative sets and irrelevant vertices: New tools for kernelization. CoRR abs/1111.2195 (2011)
Kratsch, S., Wahlström, M.: Compression via matroids: a randomized polynomial kernel for odd cycle transversal. In: SODA 2012, pp. 94–103 (2012)
Marx, D., Razgon, I.: Fixed-parameter tractability of multicut parameterized by the size of the cutset. In: STOC 2011, pp. 469–478 (2011)
Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press (2006)
Reed, B.A., Smith, K., Vetta, A.: Finding odd cycle transversals. Oper. Res. Lett. (2004)
Seymour, P.D.: Packing directed circuits fractionally. Combinatorica 15(2), 281–288 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chitnis, R., Cygan, M., Hajiaghayi, M., Marx, D. (2012). Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds) Automata, Languages, and Programming. ICALP 2012. Lecture Notes in Computer Science, vol 7391. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31594-7_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-31594-7_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31593-0
Online ISBN: 978-3-642-31594-7
eBook Packages: Computer ScienceComputer Science (R0)