Login / Signup
Towards Nearly-linear Time Algorithms for Submodular Maximization with a Matroid Constraint.
Alina Ene
Huy L. Nguyen
Published in:
CoRR (2018)
Keyphrases
</>
greedy algorithm
combinatorial optimization
worst case
orders of magnitude
theoretical analysis
computational cost
recently developed
objective function
dynamic programming
significant improvement
learning algorithm
data structure
data streams
lower bound
association rules
graph theory