Weakly Submodular Maximization Beyond Cardinality Constraints: Does Randomization Help Greedy?
Lin ChenMoran FeldmanAmin KarbasiPublished in: ICML (2018)
Keyphrases
- cardinality constraints
- greedy algorithm
- objective function
- boolean algebra
- quantifier elimination
- functional dependencies
- constraint query languages
- entity relationship
- dynamic programming
- search algorithm
- deductive databases
- worst case
- database design
- domain specific
- integrity constraints
- knowledge base
- inference rules
- knowledge representation