Improved Dynamic Algorithms for Longest Increasing Subsequence.
Tomasz KociumakaSaeed SeddighinPublished in: CoRR (2020)
Keyphrases
- computationally efficient
- computational complexity
- real time
- theoretical analysis
- data sets
- computationally expensive
- orders of magnitude
- benchmark datasets
- dynamic environments
- optimization problems
- computational cost
- learning algorithm
- simulated annealing
- upper bound
- data mining algorithms
- neural network
- graph theory