Subexponential Parameterized Algorithm for Interval Completion.
Ivan BliznetsFedor V. FominMarcin PilipczukMichal PilipczukPublished in: ACM Trans. Algorithms (2018)
Keyphrases
- computational complexity
- times faster
- dynamic programming
- learning algorithm
- improved algorithm
- convex hull
- experimental evaluation
- high accuracy
- significant improvement
- probabilistic model
- optimization algorithm
- computationally efficient
- optimal solution
- segmentation algorithm
- input data
- worst case
- k means
- theoretical analysis
- scheduling problem
- clustering method
- ant colony optimization
- tree structure
- matching algorithm
- cost function
- memory requirements
- convergence rate
- recognition algorithm
- search algorithm
- hardware implementation