Josh Alman
Skip Abstract Section
Abstract
Fixed-parameter algorithms and kernelization are two powerful methods to solve NP-hard problems. Yet so far those algorithms have been largely restricted to static inputs. In this article, we provide fixed-parameter algorithms and kernelizations for fundamental NP-hard problems with dynamic inputs. We consider a variety of parameterized graph and hitting set problems that are known to have f(k)n1+o(1) time algorithms on inputs of size n, and we consider the question of whether there is a data structure that supports small updates (such as edge/vertex/set/element insertions and deletions) with an update time of g(k)no(1); such an update time would be essentially optimal. Update and query times independent of n are particularly desirable. Among many other results, we show that FEEDBACK VERTEX SET and k-PATH admit dynamic algorithms with f(k)log O(1) update and query times for some function f depending on the solution size k only. We complement our positive results by several conditional and unconditional lower bounds. For example, we show that unlike their undirected counterparts, DIRECTED FEEDBACK VERTEX SET and DIRECTED k-PATH do not admit dynamic algorithms with no(1) update and query times even for constant solution sizes k ≤ 3, assuming popular hardness hypotheses. We also show that unconditionally, in the cell probe model, DIRECTED FEEDBACK VERTEX SET cannot be solved with update time that is purely a function of k.
- Amir Abboud and Virginia Vassilevska Williams. 2014. Popular conjectures imply strong lower bounds for dynamic problems. In Proceedings of the IEEE Annual Symposium on Foundations of Computer Science (FOCS’14). 434--443.Google Scholar
Digital Library
- Faisal N. Abu-Khzam, Judith Egan, Michael R. Fellows, Frances A. Rosamond, and Peter Shaw. 2014. On the parameterized complexity of dynamic problems with connectivity constraints. In Proceedings of the Conference on Combinatorial Optimization and Applications (COCOA’14), Lecture Notes in Computer Science, Vol. 8881. 625--636.Google ScholarCross Ref
- Faisal N. Abu-Khzam, Judith Egan, Michael R. Fellows, Frances A. Rosamond, and Peter Shaw. 2015. On the parameterized complexity of dynamic problems. Theor. Comput. Sci. 607, Part 3 (2015), 426--434.Google ScholarDigital Library
- Josh Alman, Matthias Mnich, and Virginia Vassilevska Williams. 2017. Dynamic parameterized problems and algorithms. In Proceedings of the International Colloquium on Automata, Languages, and Programming (ICALP’17), Leibniz International Proceedings in Informatics, Vol. 80. 41:1–41:16.Google Scholar
- Noga Alon, Raphael Yuster, and Uri Zwick. 1997. Finding and counting given length cycles. Algorithmica 17, 3 (1997), 209--223.Google ScholarCross Ref
- Noga Alon, Raphael Yuster, and Uri Zwick. 1995. Color-coding. J. ACM 42, 4 (1995).Google ScholarDigital Library
- Ilya Baran, Erik D. Demaine, and Mihai Pǎtraşcu. 2008. Subquadratic algorithms for 3SUM. Algorithmica 50, 4 (2008), 584--596.Google ScholarCross Ref
- Surender Baswana, Manoj Gupta, and Sandeep Sen. 2015. Fully dynamic maximal matching in O(log n) update time. SIAM J. Comput. 44, 1 (2015), 88--113.Google ScholarDigital Library
- Ann Becker, Reuven Bar-Yehuda, and Dan Geiger. 2000. Randomized algorithms for the loop cutset problem. J. Artif. Intell. Res. 12 (2000), 219--234.Google ScholarCross Ref
- Aaron Bernstein and Liam Roditty. 2011. Improved dynamic algorithms for maintaining approximate shortest paths under deletions. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA’11). 1355--1365.Google ScholarCross Ref
- Sayan Bhattacharya, Monika Henzinger, and Giuseppe F. Italiano. 2015. Deterministic fully dynamic data structures for vertex cover and matching. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA’15). 785--804.Google Scholar
- Hans L. Bodlaender. 1993. Dynamic algorithms for graphs with treewidth 2. In Proceedings of the Workshop on Graph-Theoretic Concepts in Computer Science (WG’93) (Lecture Notes Comput. Sci.), Vol. 790. 112--124.Google Scholar
- Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, and Danny Hermelin. 2009. On problems without polynomial kernels. J. Comput. Syst. Sci. 75, 8 (2009), 423--434.Google ScholarDigital Library
- Hans L. Bodlaender, Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov, and Michał Pilipczuk. 2016. A ck n 5-approximation algorithm for treewidth. SIAM J. Comput. 45, 2 (2016), 317--378.Google ScholarCross Ref
- Jonathan F. Buss and Judy Goldsmith. 1993. Nondeterminism within . SIAM J. Comput. 22, 3 (1993), 560--572.Google ScholarDigital Library
- Leizhen Cai, Siu Man Chan, and Siu On Chan. 2006. Random separation: A new method for solving fixed-cardinality optimization problems. In Proceedings of the International Symposium on Parameterized and Exact Computation (IPEC’06), Lecture Notes in Computer Science, Vol. 4169. 239--250.Google ScholarDigital Library
- Liming Cai, Jianer Chen, Rodney G. Downey, and Michael R. Fellows. 1997. Advice classes of parameterized tractability. Ann. Pure Appl. Logic 84, 1 (1997), 119--138.Google ScholarCross Ref
- Jianer Chen, Iyad A. Kanj, and Ge Xia. 2010. Improved upper bounds for vertex cover. Theoret. Comput. Sci. 411, 40 (2010), 3736--3756.Google ScholarDigital Library
- Jianer Chen, Yang Liu, Songjian Lu, Barry O’Sullivan, and Igor Razgon. 2008. A fixed-parameter algorithm for the directed feedback vertex set problem. J. ACM 55, 5 (2008).Google ScholarDigital Library
- Rajesh Hemant Chitnis, Graham Cormode, Mohammad Taghi Hajiaghayi, and Morteza Monemizadeh. 2015. Parameterized streaming: Maximal matching and vertex cover. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA’15). 1234--1251.Google ScholarCross Ref
- Bruno Courcelle. 1990. The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Inf. Comput. 85, 1 (1990), 12--75.Google ScholarDigital Library
- Marek Cygan. 2012. Deterministic parameterized connected vertex cover. In Proceedings of the Scandinavian Symposium and Workshops on Algorithm Theory (SWAT’12), Lecture Notes in Computer Science, Vol. 7357. 95--106.Google ScholarDigital Library
- Marek Cygan, Fedor Fomin, Bart M. P. Jansen, Łukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michał Pilipczuk, and Saket Saurabh. 2014. Open problems for FPT School 2014. http://fptschool.mimuw.edu.pl/opl.pdf.Google Scholar
- Marek Cygan, Fedor V. Fomin, Łukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michał Pilipczuk, and Saket Saurabh. 2015. Parameterized Algorithms. Springer, Cham.Google Scholar
- Marek Cygan, Stefan Kratsch, Marcin Pilipczuk, Michał Pilipczuk, and Magnus Wahlström. 2014. Clique cover and graph separation: New incompressibility results. ACM Trans. Comput. Theory 6, 2 (2014), 6:1–6:19.Google ScholarDigital Library
- Marek Cygan, Marcin Pilipczuk, and Michał Pilipczuk. 2016. Known algorithms for edge clique cover are probably optimal. SIAM J. Comput. 45, 1 (2016), 67--83.Google ScholarDigital Library
- Jean Daligault, Gregory Gutin, Eun Jung Kim, and Anders Yeo. 2010. FPT algorithms and kernels for the Directed -Leaf problem. J. Comput. Syst. Sci. 76, 2 (2010), 144--152.Google ScholarDigital Library
- Holger Dell and Dieter van Melkebeek. 2014. Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses. J. ACM 61, 4 (2014), 23:1–23:27.Google ScholarDigital Library
- Camil Demetrescu and Giuseppe F. Italiano. 2004. A new approach to dynamic all pairs shortest paths. J. ACM 51, 6 (2004), 968--992.Google ScholarDigital Library
- Michael Dom, Daniel Lokshtanov, and Saket Saurabh. 2009. Incompressibility through colors and IDs. In Proceedings of the International Colloquium on Automata, Languages, and Programming (ICALP’09), Lecture Notes in Computer Science, Vol. 5555. 378--389.Google ScholarDigital Library
- Frederic Dorn. 2010. Planar subgraph isomorphism revisited. In Proceedings of the Symposium on Theoretical Aspects of Computer Science (STACS’10), Leibniz International Proceedings in Informatics, Vol. 5. 263--274.Google Scholar
- Zdeněk Dvořák, Martin Kupec, and Vojtěch Tůma. 2014. A dynamic data structure for MSO properties in graphs with bounded tree-depth. In Proceedings of the European Symposium on Algorithms (ESA’14), Lecture Notes in Computer Science, Vol. 8737. 334--345.Google Scholar
- Zdeněk Dvořák and Vojtěch Tůma. 2013. A dynamic data structure for counting subgraphs in sparse graphs. In Proceedings of the Algorithms and Data Structures Symposium (WADS’13), Lecture Notes in Computer Science, Vol. 8037. 304--315.Google ScholarDigital Library
- Ranel E. Erickson, Clyde L. Monma, and Jr. Arthur F. Veinott. 1987. Send-and-split method for minimum-concave-cost network flows. Math. Oper. Res. 12, 4 (1987), 634--664.Google ScholarDigital Library
- Vladimir Estivill-Castro, Michael R. Fellows, Michael A. Langston, and Frances A. Rosamond. 2005. FPT is P-time extremal structure I. In Proceedings of the Algorithms and Complexity Workshop in Durham (ACiD’05). 1--41.Google Scholar
- Michael Etscheid and Matthias Mnich. 2016. Linear kernels and linear time algorithms for finding large cuts. In Proceedings of the International Symposium on Algorithms and Computation (ISAAC’16), Leibniz International Proceedings in Informatics, Vol. 64. 31:1–31:13.Google Scholar
- Stefan Fafianie and Stefan Kratsch. 2015. A shortcut to (sun)flowers: Kernels in logarithmic space or linear time. In Proceedings of the International Symposium on Mathematical Foundations of Computer Science (MFCS’15), Lecture Notes in Computer Science, Vol. 9235. 299--310.Google ScholarCross Ref
- Henning Fernau. 2006. Edge dominating set: Efficient enumeration-based exact algorithms. In Proceedings of the International Symposium on Parameterized and Exact Computation (IPEC’06), Lecture Notes in Computer Science, Vol. 4169. 142--153.Google ScholarDigital Library
- Bernhard Fuchs, Walter Kern, Daniel Mölle, Stefan Richter, Peter Rossmanith, and Xinhui Wang. 2007. Dynamic programming for minimum Steiner trees. Theory Comput. Syst. 41, 3 (2007), 493--500.Google ScholarDigital Library
- Anka Gajentaan and Mark H. Overmars. 2012. On a class of problems in computational geometry. Comput. Geom. 45, 4 (2012), 140--152.Google ScholarDigital Library
- François Le Gall. 2014. Powers of tensors and fast matrix multiplication. In Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC'14). 296--303.Google ScholarDigital Library
- David Gibb, Bruce Kapron, Valerie King, and Nolan Thorn. 2015. Dynamic Graph Connectivity with Improved Worst Case Update Time and Sublinear Space. Technical Report. https://arxiv.org/abs/1509.06464https://arxiv.org/abs/1509.06464 -->.Google Scholar
- Jens Gramm, Jiong Guo, Falk Hüffner, and Rolf Niedermeier. 2009. Data reduction and exact algorithms for clique cover. J. Exp. Algor. 13, Article 2 (2009), 2:2.2–2:2.15 pages.Google Scholar
- Manoj Gupta and Richard Peng. 2013. Fully dynamic -approximate matchings. In Proceedings of the IEEE Annual Symposium on Foundations of Computer Science (FOCS’13). 548--557.Google ScholarDigital Library
- Andras Gyárfás. 1990. A simple lower bound on edge coverings by cliques. Discr. Math. 85, 1 (1990), 103--104.Google ScholarDigital Library
- Godfrey H. Hardy and S. Ramanujan. 1918. Asymptotic formulæ in combinatory analysis. Proc. Lond. Math. Soc. s2-17, 1 (1918), 75--115.Google ScholarCross Ref
- Monika Henzinger, Sebastian Krinninger, and Danupon Nanongkai. 2015. Improved algorithms for decremental single-source reachability on directed graphs. In Proceedings of the International Colloquium on Automata, Languages, and Programming (ICALP’15), Lecture Notes in Computer Science, Vol. 9134. 725--736.Google ScholarCross Ref
- Monika Henzinger, Sebastian Krinninger, and Danupon Nanongkai. 2016. Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization. SIAM J. Comput. 45, 3 (2016), 947--1006.Google ScholarDigital Library
- Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai, and Thatchaphol Saranurak. 2015. Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture. In Proceedings of the IEEE Annual Symposium on Foundations of Computer Science (FOCS’15). 21--30.Google ScholarDigital Library
- Monika Rauch Henzinger and Valerie King. 1999. Randomized fully dynamic graph algorithms with polylogarithmic time per operation. J. ACM 46, 4 (1999), 502--516.Google ScholarDigital Library
- Monika Rauch Henzinger and Valerie King. 2001. Maintaining minimum spanning forests in dynamic graphs. SIAM J. Comput. 31, 2 (2001), 364--374.Google ScholarDigital Library
- Monika Rauch Henzinger and Mikkel Thorup. 1997. Sampling to provide or to bound: With applications to fully dynamic graph algorithms. Rand. Struct. Algor. 11, 4 (1997), 369--379.Google ScholarDigital Library
- Jacob Holm, Kristian de Lichtenberg, and Mikkel Thorup. 2001. Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. J. ACM 48, 4 (2001), 723--760.Google ScholarDigital Library
- Shang-En Huang, Dawei Huang, Tsvi Kopelowitz, and Seth Pettie. 2016. Fully Dynamic Connectivity in O(log n(log log n)2) Amortized Expected Time. Technical Report. http://arxiv.org/abs/1609.05867http://arxiv.org/abs/1609.05867.Google Scholar
- Alon Itai and Michael Rodeh. 1978. Finding a minimum circuit in a graph. SIAM J. Comput. 7, 4 (1978), 413--423.Google ScholarDigital Library
- Ken Iwaide and Hiroshi Nagamochi. 2016. An improved algorithm for parameterized edge dominating set problem. J. Graph Algor. Appl. 20, 1 (2016), 23--58.Google ScholarCross Ref
- Yoichi Iwata. 2017. A linear time kernelization for feedback vertex set. In Proceedings of the International Colloquium on Automata, Languages, and Programming (ICALP’17), Leibniz International Proceedings in Informatics, Vol. 80. 68:1–68:14.Google Scholar
- Yoichi Iwata and Keigo Oka. 2014. Fast dynamic graph algorithms for parameterized problems. In Proceedings of the Scandinavian Symposium and Workshops on Algorithm Theory (SWAT’14), Lecture Notes in Computer Science, Vol. 8503. 241--252.Google ScholarCross Ref
- Yoichi Iwata, Keigo Oka, and Yuichi Yoshida. 2014. Linear-time FPT algorithms via network flow. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA’14). 1749--1761.Google ScholarCross Ref
- Bruce M. Kapron, Valerie King, and Ben Mountjoy. 2013. Dynamic graph connectivity in polylogarithmic worst case time. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA’13). 1131--1142.Google ScholarCross Ref
- Tsvi Kopelowitz, Seth Pettie, and Ely Porat. 2016. Higher lower bounds from the 3SUM conjecture. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA’16). 1272--1287.Google ScholarCross Ref
- Stefan Kratsch, Geevarghese Philip, and Saurabh Ray. 2016. Point line cover: The easy kernel is essentially tight. ACM Trans. Algor. 12, 3 (2016), 40:1–40:16.Google Scholar
- Stefan Kratsch and Magnus Wahlström. 2012. Representative sets and irrelevant vertices: New tools for kernelization. In Proceedings of the IEEE Annual Symposium on Foundations of Computer Science (FOCS’12). 450--459.Google ScholarDigital Library
- Jakub Łacki, Jakub Oćwieja, Marcin Pilipczuk, Piotr Sankowski, and Anna Zych. 2015. The power of dynamic distance oracles: Efficient dynamic algorithms for the Steiner tree. In Proceedings of the ACM Symposium on Theory of Computing (STOC’15). 11--20.Google Scholar
- Stefan Langerman and Pat Morin. 2005. Covering things with things. Discr. Comput. Geom. 33, 4 (2005), 717--729.Google ScholarDigital Library
- Daniel Lokshtanov, N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, and Saket Saurabh. 2014. Faster parameterized algorithms using linear programming. ACM Trans. Algor. 11, 2 (2014), 15:1–15:31.Google Scholar
- Daniel Lokshtanov, M. S. Ramanujan, and Saket Saurabh. 2015. Linear time parameterized algorithms for subset feedback vertex set. In Proceedings of the International Colloquium on Automata, Languages, and Programming (ICALP’15), Lecture Notes in Computer Science, Vol. 9134. 935--946.Google ScholarCross Ref
- Daniel Lokshtanov, M. S. Ramanujan, and Saket Saurabh. 2018. When recursion is better than iteration: A linear-time algorithm for acyclicity with few error vertices. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA'18). 1916–1933.Google ScholarCross Ref
- Aleksander Madry. 2013. Navigating central path with electrical flows: From flows to matchings, and back. In Proceedings of the IEEE Annual Symposium on Foundations of Computer Science (FOCS’13). 253--262.Google ScholarDigital Library
- M. Naor, L. J. Schulman, and A. Srinivasan. 1995. Splitters and near-optimal derandomization. In Proceedings of the IEEE Annual Symposium on Foundations of Computer Science (FOCS’95). 182--191.Google Scholar
- Krzysztof Onak and Ronitt Rubinfeld. 2010. Maintaining a large matching and a small vertex cover. In Proceedings of the ACM Symposium on Theory of Computing (STOC’10). 457--464.Google ScholarDigital Library
- Mihai Pǎtraşcu. 2010. Towards polynomial lower bounds for dynamic problems. In Proceedings of the ACM Symposium on Theory of Computing (STOC’10). 603--610.Google ScholarDigital Library
- Mihai Pǎtraşcu. 2011. Unifying the landscape of cell-probe lower bounds. SIAM J. Comput. 40, 3 (2011), 827--847.Google ScholarDigital Library
- Mihai Pǎtraşcu and Erik D. Demaine. 2006. Logarithmic lower bounds in the cell-probe model. SIAM J. Comput. 35, 4 (2006), 932--963.Google ScholarDigital Library
- Mihai Pǎtraşcu and Mikkel Thorup. 2011. Don’t rush into a union: Take time to find your roots. In Proceedings of the ACM Symposium on Theory of Computing (STOC’11). 559--568.Google Scholar
- Daniel D. Sleator and Robert Endre Tarjan. 1983. A data structure for dynamic trees. J. Comput. System Sci. 26, 3 (1983), 362--391.Google ScholarDigital Library
- Shay Solomon. 2016. Fully dynamic maximal matching in constant update time. In Proceedings of the IEEE Annual Symposium on Foundations of Computer Science (FOCS’16). 325--334.Google ScholarCross Ref
- Mikkel Thorup. 2000. Near-optimal fully-dynamic graph connectivity. In Proceedings of the ACM Symposium on Theory of Computing (STOC’00). 343--350.Google ScholarDigital Library
- René van Bevern. 2014. Towards optimal and expressive kernelization for -hitting set. Algorithmica 70, 1 (2014), 129--147.Google Scholar
- Virginia Vassilevska Williams. 2012. Multiplying matrices faster than Coppersmith-Winograd. In Proceedings of the ACM Symposium on Theory of Computing (STOC’12). 887--898.Google ScholarDigital Library
- Jens Vygen. 2011. Faster algorithm for optimum Steiner trees. Inf. Proc. Lett. 111, 21–22 (2011), 1075--1079.Google ScholarDigital Library
- Magnus Wahlström. 2014. Half-integrality, LP-branching and FPT algorithms. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA’14). 1762--1781.Google ScholarCross Ref
- Christian Wulff-Nilsen. 2013. Faster deterministic fully-dynamic graph connectivity. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA’13). 1757--1769.Google ScholarCross Ref
Index Terms
- Dynamic Parameterized Problems and Algorithms
Recommendations
The Parameterized Complexity of Stabbing Rectangles
The NP-complete geometric covering problem Rectangle Stabbing is defined as follows: Given a set R of axis-parallel rectangles in the plane, a set L of horizontal and vertical lines in the plane, and a positive integer k, select at most k of the lines ...
Parameterized algorithms for generalizations of Directed Feedback Vertex Set
AbstractThe Directed Feedback Vertex Set (DFVS) problem takes as input a directed graph G and seeks a smallest vertex set S that hits all cycles in G. This is one of Karp’s 21 NP-complete problems. Resolving the parameterized complexity status ...
Parameterised Algorithms for Deletion to Classes of DAGs
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, ...
Comments