Weighted flow time does not admit O(1)-competitive algorithms.
Nikhil BansalHo-Leung ChanPublished in: SODA (2009)
Keyphrases
- data structure
- times faster
- computational complexity
- theoretical analysis
- case study
- multi class
- semi supervised
- computationally efficient
- optimization problems
- recently developed
- genetic algorithm
- data mining algorithms
- orders of magnitude
- data mining techniques
- worst case
- computational cost
- similarity measure
- image segmentation
- decision trees
- learning algorithm