Dynamic parameterized problems and algorithms

DOI10.4230/LIPICS.ICALP.2017.41zbMATH Open1441.68103arXiv1707.00362OpenAlexW2962799767MaRDI QIDQ5111372FDOQ5111372

Virginia Vassilevska Williams, Matthias Mnich, Josh Alman

Publication date: 27 May 2020

Abstract: Fixed-parameter algorithms and kernelization are two powerful methods to solve $mathsfNP$-hard problems. Yet, so far those algorithms have been largely restricted to static inputs. In this paper we provide fixed-parameter algorithms and kernelizations for fundamental $mathsfNP$-hard problems with dynamic inputs. We consider a variety of parameterized graph and hitting set problems which are known to have $f(k)n^{1+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)n^{o(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)lo{g}^{O(1)}n$ 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 $n^{o(1)}$ update and query times even for constant solution sizes $kleq3$, 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$.

Full work available at URL: https://arxiv.org/abs/1707.00362

Recommendations

• Fast dynamic graph algorithms for parameterized problems
• Dynamic parameterized problems
• Dynamic Parameterized Problems
• On the parameterized complexity of dynamic problems
• Algorithms and Data Structures

zbMATH Keywords

fixed-parameter algorithmsdynamic algorithms

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Parameterized complexity, tractability and kernelization (68Q27)

Cited In (9)

• Dynamic kernels for hitting sets and set packing
• Linear-time parameterized algorithms with limited local resources
• Dynamic Parameterized Problems
• How fast can we play Tetris greedily with rectangular pieces?
• Nearly time-optimal kernelization algorithms for the line-cover problem with big data
• Multistage vertex cover
• Parameterized Dynamic Variants of Red-Blue Dominating Set
• Reoptimization of parameterized problems
• Dynamic data structures for timed automata acceptance

This page was built for publication: Dynamic parameterized problems and algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111372)