Polynomial time algorithm for an optimal stable assignment with multiple partners.
Vipul BansalAseem AgrawalVarun S. MalhotraPublished in: Theor. Comput. Sci. (2007)
Keyphrases
- worst case
- dynamic programming
- optimal solution
- learning algorithm
- optimization algorithm
- detection algorithm
- computational complexity
- times faster
- np hard
- objective function
- exhaustive search
- significant improvement
- computational cost
- neural network
- decision trees
- optimal path
- globally optimal
- matching algorithm
- locally optimal
- linear programming
- cost function
- search space
- particle swarm optimization
- markov random field
- experimental evaluation
- closed form
- k means
- preprocessing
- bayesian networks