Simultaneous approximation by greedy algorithms.
Dany LeviatanVladimir N. TemlyakovPublished in: Adv. Comput. Math. (2006)
Keyphrases
- greedy algorithms
- greedy algorithm
- approximation ratio
- knapsack problem
- influence spread
- error bounds
- closed form
- search algorithm
- worst case
- approximation error
- computational complexity
- objective function
- artificial neural networks
- data sets
- similarity measure
- search engine
- orthogonal matching pursuit
- neural network