Tight Approximation Bounds for Greedy Frugal Coverage Algorithms.
Ioannis CaragiannisChristos KaklamanisMaria KyropoulouPublished in: FAW-AAIM (2011)
Keyphrases
- worst case
- lower bound
- error bounds
- orders of magnitude
- optimization problems
- learning algorithm
- upper bound
- theoretical analysis
- lower and upper bounds
- computational complexity
- machine learning algorithms
- average case
- greedy algorithm
- stochastic search
- mistake bound
- upper and lower bounds
- generalization error bounds
- computational efficiency
- approximation algorithms
- combinatorial optimization
- times faster
- computationally efficient
- computational cost
- data structure