Login / Signup
On the Approximability of the Stable Matching Problem with Ties of Constant Size up to the Integrality Gap.
Jochen Könemann
Kanstantsin Pashkovich
Natig Tofigzade
Published in:
CoRR (2020)
Keyphrases
</>
approximation algorithms
integrality gap
small size
linear programming relaxation
constant factor
special case
arbitrarily close
linear program