Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint.
Min CuiDachuan XuLongkun GuoDan WuPublished in: J. Comb. Optim. (2022)
Keyphrases
- submodular functions
- approximation guarantees
- greedy algorithm
- cardinality constraints
- objective function
- functional dependencies
- worst case
- dynamic programming
- entity relationship
- database schema
- knapsack problem
- lower bound
- cost function
- supervised learning
- linear programming
- relational databases
- pairwise
- learning algorithm