Approximation Guarantees for Parallelized Maximization of Monotone Non-submodular Function with a Cardinality Constraint.
Min CuiDachuan XuLongkun GuoDan WuPublished in: AAIM (2020)
Keyphrases
- linear program
- submodular functions
- approximation guarantees
- cardinality constraints
- objective function
- greedy algorithm
- linear programming
- dynamic programming
- functional dependencies
- lower bound
- optimization problems
- cost function
- feasible solution
- entity relationship
- worst case
- integrity constraints
- np hard
- database schema
- approximation ratio
- upper bound
- facility location problem
- knapsack problem
- genetic algorithm