Abstract
In the Directed Feedback Vertex Set (DFVS) problem, we are given a digraph D on n vertices and a positive integer k, and the objective is to check whether there exists a set of vertices S such that F = D − S is an acyclic digraph. In a recent paper, Mnich and van Leeuwen [STACS 2016 ] studied the kernelization complexity of DFVS with an additional restriction on F—namely that F must be an out-forest, an out-tree, or a (directed) pumpkin—with an objective of shedding some light on the kernelization complexity of the DFVS problem, a well known open problem in the area. The vertex deletion problems corresponding to obtaining an out-forest, an out-tree, or a (directed) pumpkin are Out-forest/Out-tree/Pumpkin Vertex Deletion Set, respectively. They showed that Out-forest/Out-tree/Pumpkin Vertex Deletion Set admit polynomial kernels. Another open problem regarding DFVS is that, does DFVS admit an algorithm with running time \(2^{\mathcal {O}(k)} n^{\mathcal {O}(1)}\)? We complement the kernelization programme of Mnich and van Leeuwen by designing fast FPT algorithms for the above mentioned problems. In particular, we design an algorithm for Out-forest Vertex Deletion Set that runs in time \(\mathcal {O}(2.732^{k} n^{\mathcal {O}(1)})\) and algorithms for Pumpkin/Out-tree Vertex Deletion Set that runs in time \(\mathcal {O}(2.562^{k} n^{\mathcal {O}(1)})\). As a corollary of our FPT algorithms and the recent result of Fomin et al. [STOC 2016] which gives a relation between FPT algorithms and exact algorithms, we get exact algorithms for Out-forest/Out-tree/Pumpkin Vertex Deletion Set that run in time \(\mathcal {O}(1.633^{n} n^{\mathcal {O}(1)})\), \(\mathcal {O}(1.609^{n} n^{\mathcal {O}(1)})\) and \(\mathcal {O}(1.609^{n} n^{\mathcal {O}(1)})\), respectively.
Similar content being viewed by others
References
Abu-Khzam, F.N.: A kernelization algorithm for d-Hitting Set. JCSS 76(7), 524–531 (2010)
Bafna, V., Berman, P., Fujito, T.: A 2-approximation algorithm for the undirected feedback vertex set problem. SIDMA 12(3), 289–297 (1999)
Bang-Jensen, J., Maddaloni, A., Saurabh, S.: Algorithms and kernels for feedback set problems in generalizations of tournaments. Algorithmica 76(2), 320–343 (2016)
Bar-Yehuda, R., Geiger, D., Naor, J., Roth, R.M.: Approximation algorithms for the feedback vertex set problem with applications to constraint satisfaction and Bayesian inference. SICOMP 27(4), 942–959 (1998)
Becker, A., Geiger, D.: Optimization of pearl’s method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem. Artif. Intell 83(1), 167–188 (1996)
Cao, Y., Chen, J., Liu, Y.: On feedback vertex set new measure and new structures. In: SWAT, pp. 93–104 (2010)
Chekuri, C., Madan, V.: Constant factor approximation for subset feedback problems via a new LP relaxation. In: SODA, pp 808–820 (2016)
Chen, J., Fomin, F.V., Liu, Y., Lu, S., Villanger, Y.: Improved algorithms for feedback vertex set problems. JCSS 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. Journal of the ACM (JACM) 55(5), 21 (2008)
Chitnis, R.H., Cygan, M., Hajiaghayi, M.T., Marx, D.: Directed subset feedback vertex set is fixed-parameter tractable. TALG 11(4), 28 (2015)
Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Berlin (2015)
Cygan, M., Nederlof, J., Pilipczuk, M., Pilipczuk, M., Rooij, J.M.M., Wojtaszczyk, J.O.: Solving connectivity problems parameterized by treewidth in single exponential time. In: FOCS, pp 150–159 (2011)
Cygan, M., Pilipczuk, M., Pilipczuk, M., Wojtaszczyk, J.O.: Subset feedback vertex set is fixed-parameter tractable. SIDMA 27(1), 290–309 (2013)
Diestel, R.: Graph Theory, 4th edn. Springer, Berlin (2012)
Dom, M., Guo, J., Hüffner, F., Niedermeier, R., Truß, A.: Fixed-parameter tractability results for feedback set problems in tournaments. JDA 8(1), 76–86 (2010)
Downey, R.G., Fellows, M.R.: Parameterized complexity. Springer, Berlin (1997)
Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Springer, Berlin (2013)
Erdős, P., Pósa, L.: On independent circuits contained in a graph. Canad. J. Math. 17, 347–352 (1965)
Even, G., Naor, J., Schieber, B., Sudan, M.: Approximating minimum feedback sets and multicuts in directed graphs. Algorithmica 20(2), 151–174 (1998)
Fomin, F.V., Gaspers, S., Lokshtanov, D., Saurabh, S.: Exact algorithms via monotone local search. In: STOC, pp 764–775 (2016)
Guruswami, V., Lee, E.: Inapproximability of H-transversal/packing. In: APPROX/RANDOM, pp 284–304 (2015)
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, pp 1726–1736 (2012)
Kakimura, N., Kawarabayashi, K., Marx, D.: Packing cycles through prescribed vertices. J. Comb. Theory, Ser. B 101(5), 378–381 (2011)
Kawarabayashi, K., Kobayashi, Y.: Fixed-parameter tractability for the subset feedback set problem and the S-cycle packing problem. J. Comb. Theory, Ser. B 102(4), 1020–1034 (2012)
Kawarabayashi, K., Král, D., Krcál, M., Kreutzer, S.: Packing directed cycles through a specified vertex set. In: SODA, pp 365–377 (2013)
Kociumaka, T., Pilipczuk, M.: Faster deterministic feedback vertex set. IPL 114(10), 556–560 (2014)
Mehlhorn, K.: Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness, EATCS Monographs on Theoretical Computer Science, vol. 2. Springer, Berlin (1984)
Mnich, M., van Leeuwen, E.J.: Polynomial kernels for deletion to classes of acyclic digraphs. In: STACS, pp 1–13 (2016)
Pontecorvi, M., Wollan, P.: Disjoint cycles intersecting a set of vertices. J. Comb. Theory, Ser. B 102(5), 1134–1141 (2012)
Raman, V., Saurabh, S., Subramanian, C.R.: Faster fixed parameter tractable algorithms for finding feedback vertex sets. TALG 2(3), 403–415 (2006)
Raman, V., Saurabh, S., Suchẏ, O.: An FPT algorithm for tree deletion set. J. Graph Algorithms Appl. 17(6), 615–628 (2013)
Reed, B.A., Robertson, N., Seymour, P.D., Thomas, R.: Packing directed circuits. Combinatorica 16(4), 535–554 (1996)
Seymour, P.D.: Packing directed circuits fractionally. Combinatorica 15(2), 281–288 (1995)
Seymour, P.D.: Packing circuits in eulerian digraphs. Combinatorica 16(2), 223–231 (1996)
Wahlström, M.: Half-integrality, LP-branching and FPT Algorithms. In: SODA, pp 1762–1781 (2014)
Acknowledgements
We thank the anonymous reviewers for their useful comments on improving the presentation of this article.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Agrawal, A., Saurabh, S., Sharma, R. et al. Parameterised Algorithms for Deletion to Classes of DAGs. Theory Comput Syst 62, 1880–1909 (2018). https://doi.org/10.1007/s00224-018-9852-7
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00224-018-9852-7