Better and Simpler Approximation Algorithms for the Stable Marriage Problem.
Zoltán KirályPublished in: ESA (2008)
Keyphrases
- approximation algorithms
- stable marriage
- partial order
- related problems
- vertex cover
- soft constraints
- special case
- np hard
- worst case
- minimum cost
- facility location problem
- primal dual
- network design problem
- set cover
- np hardness
- approximation schemes
- open shop
- precedence constraints
- approximation ratio
- disjoint paths
- learning algorithm
- constant factor approximation
- polynomial time approximation
- undirected graph
- linear programming
- lower bound
- reinforcement learning