Approximation Algorithms for Matroidal and Cardinal Generalizations of Stable Matching.
Gergely CsájiTamás KirályYu YokoiPublished in: CoRR (2022)
Keyphrases
- approximation algorithms
- np hard
- special case
- minimum cost
- vertex cover
- worst case
- set cover
- graph matching
- constant factor
- network design problem
- open shop
- exact algorithms
- randomized algorithms
- precedence constraints
- np hardness
- primal dual
- approximation ratio
- scheduling problem
- facility location problem
- undirected graph
- approximation guarantees
- approximation schemes
- combinatorial auctions
- disjoint paths