Streaming algorithm for maximizing a monotone non-submodular function under d-knapsack constraint.
Yanjun JiangYishui WangDachuan XuRuiqi YangYong ZhangPublished in: Optim. Lett. (2020)
Keyphrases
- dynamic programming
- objective function
- computational complexity
- cost function
- probabilistic model
- knapsack problem
- greedy algorithm
- np hard
- submodular functions
- search space
- data streams
- optimal solution
- similarity measure
- learning algorithm
- upper bound
- worst case
- linear programming
- shortest path
- combinatorial optimization
- convex hull
- lower and upper bounds
- machine learning