A Tight Combinatorial Algorithm for Submodular Maximization Subject to a Matroid Constraint.
Yuval FilmusJustin WardPublished in: FOCS (2012)
Keyphrases
- objective function
- preprocessing
- experimental evaluation
- np hard
- dynamic programming
- worst case
- segmentation algorithm
- times faster
- computational complexity
- detection algorithm
- high accuracy
- computational cost
- cost function
- k means
- learning algorithm
- recognition algorithm
- greedy algorithm
- combinatorial optimization
- improved algorithm
- linear programming
- particle swarm optimization
- matching algorithm
- optimization algorithm
- data sets
- penalty function
- metaheuristic
- theoretical analysis
- optimization problems
- upper bound
- scheduling problem
- multi objective
- evolutionary algorithm
- neural network