Dynamic Parameterized Problems and Algorithms
© 2020 ACM. 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 dyna...
Main Authors: | Alman, Josh, Mnich, Matthias, Williams, Virginia Vassilevska |
---|---|
Format: | Article |
Language: | English |
Published: |
Association for Computing Machinery (ACM)
2021
|
Online Access: | https://hdl.handle.net/1721.1/135282 |
Similar Items
-
Dynamic Parameterized Problems and Algorithms
by: Alman, Josh, et al.
Published: (2022) -
Dynamic Parameterized Problems and Algorithms
by: Alman, Josh, et al.
Published: (2022) -
Further Limitations of the Known Approaches for Matrix Multiplication
by: Alman, Josh, et al.
Published: (2021) -
Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication
by: Alman, Josh, et al.
Published: (2021) -
OV graphs are (probably) hard instances
by: Alman, Josh, et al.
Published: (2021)