A Faster Parameterized Algorithm for Treedepth.
Felix ReidlPeter RossmanithFernando Sánchez VillaamilSomnath SikdarPublished in: ICALP (1) (2014)
Keyphrases
- preprocessing
- search space
- segmentation algorithm
- high accuracy
- dynamic programming
- learning algorithm
- memory efficient
- machine learning
- linear programming
- experimental evaluation
- cost function
- np hard
- computational complexity
- optimal solution
- convex hull
- recognition algorithm
- experimental study
- improved algorithm
- detection algorithm
- optimization algorithm
- estimation algorithm
- worst case
- computational cost
- hardware implementation
- space complexity
- convergence rate
- objective function
- path planning
- segmentation method
- clustering method
- computationally efficient
- input data
- search algorithm
- significant improvement