Almost Stable Matchings by Truncating the Gale-Shapley Algorithm.
Patrik FloréenPetteri KaskiValentin PolishchukJukka SuomelaPublished in: Algorithmica (2010)
Keyphrases
- dynamic programming
- learning algorithm
- computational complexity
- cost function
- recognition algorithm
- experimental evaluation
- k means
- matching algorithm
- detection algorithm
- preprocessing
- single pass
- improved algorithm
- estimation algorithm
- probabilistic model
- neural network
- simulated annealing
- optimization algorithm
- selection algorithm
- space complexity
- times faster
- knn
- classification algorithm
- clustering method
- high accuracy
- computational cost
- multi objective
- search space
- objective function
- bayesian networks
- genetic algorithm