A Simple 1.5-approximation Algorithm for a Wide Range of Maximum Size Stable Matching Problems.
Gergely CsájiPublished in: AAMAS (2024)
Keyphrases
- wide range
- matching algorithm
- worst case
- dynamic programming
- computational complexity
- benchmark problems
- closed form
- space complexity
- detection algorithm
- learning algorithm
- iterative algorithms
- space requirements
- memory requirements
- optimization algorithm
- computational cost
- cost function
- objective function
- optimization problems
- absolute error
- error tolerance
- maximum number
- matching process
- search space
- error bounds
- k means
- segmentation algorithm
- preprocessing
- recognition algorithm
- greedy algorithm
- combinatorial optimization
- bayesian networks
- genetic algorithm
- polynomial time approximation