A Fast Block-Greedy Algorithm for Quasi-optimal Meshless Trial Subspace Selection.
Leevan LingPublished in: SIAM J. Sci. Comput. (2016)
Keyphrases
- greedy algorithm
- worst case
- dynamic programming
- greedy heuristic
- greedy algorithms
- objective function
- greedy strategy
- approximation guarantees
- optimal solution
- set cover
- influence spread
- machine learning
- submodular functions
- knapsack problem
- linear programming
- approximation ratio
- np hard
- reinforcement learning
- influence maximization
- search engine
- learning algorithm