Towards Nearly-Linear Time Algorithms for Submodular Maximization with a Matroid Constraint.
Alina EneHuy L. NguyenPublished in: ICALP (2019)
Keyphrases
- greedy algorithm
- computationally efficient
- objective function
- data structure
- worst case
- combinatorial optimization
- theoretical analysis
- computationally expensive
- learning algorithm
- significant improvement
- recently developed
- computational efficiency
- submodular functions
- stopping criterion
- orders of magnitude
- particle swarm optimization
- optimization problems
- image sequences
- clustering algorithm