Improved approximation algorithms for two variants of the stable marriage problem with ties.
Chien-Chung HuangTelikepalli KavithaPublished in: Math. Program. (2015)
Keyphrases
- approximation algorithms
- stable marriage
- np hard
- special case
- partial order
- worst case
- vertex cover
- minimum cost
- network design problem
- facility location problem
- related problems
- set cover
- randomized algorithms
- open shop
- undirected graph
- soft constraints
- precedence constraints
- np hardness
- polynomial time approximation
- approximation schemes
- constant factor approximation
- bayesian networks
- disjoint paths
- combinatorial auctions