A new greedy strategy for maximizing monotone submodular function under a cardinality constraint.

Cheng Lu Wenguo Yang Suixiang Gao

Published in: J. Glob. Optim. (2022)

Keyphrases

submodular functions
greedy algorithm
greedy strategy
cardinality constraints
functional dependencies
objective function
worst case
dynamic programming
entity relationship
database schema
integrity constraints
bayesian networks
scheduling problem
upper bound
logic programming