Tight approximation bounds for combinatorial frugal coverage algorithms.
Ioannis CaragiannisChristos KaklamanisMaria KyropoulouPublished in: J. Comb. Optim. (2013)
Keyphrases
- worst case
- error bounds
- lower bound
- learning algorithm
- neural network
- closed form
- optimization problems
- upper bound
- computational cost
- data structure
- theoretical analysis
- approximation methods
- worst case analysis
- error estimates
- significant improvement
- machine learning
- data sets
- approximation algorithms
- approximation schemes
- error tolerance
- generalization error bounds