A strongly polynomial time algorithm for a constrained submodular optimization problem.
David HartvigsenPublished in: Discret. Appl. Math. (2001)
Keyphrases
- optimization algorithm
- computational complexity
- optimization model
- dynamic programming
- high accuracy
- experimental evaluation
- objective function
- cost function
- optimization process
- times faster
- improved algorithm
- worst case
- search space
- np hard
- expectation maximization
- matching algorithm
- learning algorithm
- computational cost
- preprocessing
- optimal solution
- simulated annealing
- optimization problems
- np complete
- special case
- energy function
- significant improvement
- optimization method
- feature selection
- neural network
- concave convex procedure