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