Streaming Algorithms for Online Selection Problems.
José R. CorreaPaul DüttingFelix A. FischerKevin SchewiorBruno ZiliottoPublished in: CoRR (2020)
Keyphrases
- optimization problems
- benchmark problems
- real time
- test problems
- hard problems
- learning algorithm
- theoretical analysis
- orders of magnitude
- combinatorial optimization
- problems in computer vision
- practical problems
- significant improvement
- computational cost
- data structure
- run times
- search methods
- convex optimization problems
- np hard problems
- computationally hard
- greedy algorithms
- online convex optimization
- approximate solutions
- times faster
- np complete
- evolutionary algorithm
- related problems
- computational geometry
- theoretical guarantees
- inference problems
- worst case
- search algorithm
- decision trees
- data sets