Weakly Submodular Maximization Beyond Cardinality Constraints: Does Randomization Help Greedy?
Lin ChenMoran FeldmanAmin KarbasiPublished in: CoRR (2017)
Keyphrases
- cardinality constraints
- greedy algorithm
- objective function
- boolean algebra
- quantifier elimination
- functional dependencies
- constraint query languages
- entity relationship
- worst case
- dynamic programming
- closed sets
- energy minimization
- knapsack problem
- database schema
- deductive databases
- integrity constraints
- optimization problems
- relational databases
- inference rules
- search algorithm
- knowledge base
- distributed systems
- search space