scientific article; zbMATH DE number 7378730
From MaRDI portal
Publication:5009626
DOI10.4230/LIPIcs.ESA.2018.60MaRDI QIDQ5009626
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/1804.00553
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (3)
Complexity study for the robust stable marriage problem ⋮ Preference swaps for the stable matching problem ⋮ Bribery and Control in Stable Marriage
Cites Work
- Unnamed Item
- Unnamed Item
- On the complexity of robust stable marriage
- On distributionally robust chance-constrained linear programs
- An efficient algorithm for the “stable roommates” problem
- The Complexity of Counting Stable Marriages
- Algorithmics of Matching Under Preferences
- College Admissions and the Stability of Marriage
This page was built for publication: