Login / Signup
Nearly Linear-Time, Deterministic Algorithm for Maximizing (Non-Monotone) Submodular Functions Under Cardinality Constraint.
Alan Kuhnle
Published in:
CoRR (2019)
Keyphrases
</>
worst case
cost function
dynamic programming
optimal solution
simulated annealing
objective function
computational complexity
np hard
probabilistic model
expectation maximization
learning algorithm
database design