A tight analysis of the Katriel-Bodlaender algorithm for online topological ordering.
Hsiao-Fei LiuKun-Mao ChaoPublished in: Theor. Comput. Sci. (2007)
Keyphrases
- experimental evaluation
- worst case
- detection algorithm
- preprocessing
- cost function
- np hard
- dynamic programming
- improved algorithm
- computational complexity
- learning algorithm
- expectation maximization
- selection algorithm
- high accuracy
- optimal solution
- classification algorithm
- optimization algorithm
- lower bound
- probabilistic model
- memory requirements
- significant improvement
- segmentation algorithm
- data analysis
- matching algorithm
- path planning
- times faster
- convex hull
- shows a significant improvement
- particle swarm optimization
- online learning
- simulated annealing
- k means