Dynamic Complexity Meets Parameterised Algorithms.
Jonas SchmidtThomas SchwentickNils VortmeierThomas ZeumeIoannis KokkinisPublished in: CoRR (2019)
Keyphrases
- worst case
- computational complexity
- data structure
- computational cost
- computationally efficient
- case study
- computational efficiency
- orders of magnitude
- theoretical analysis
- optimization problems
- computational issues
- complexity analysis
- graph theory
- times faster
- dynamic environments
- learning algorithm
- databases
- dynamic programming
- database systems
- image segmentation
- recently developed
- decision trees
- high computational complexity
- machine learning