A Searching for Strongly Egalitarian and Sex-Equal Stable Matchings
- 23 May 2019
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC
- p. 1100-1111
- https://doi.org/10.1007/978-3-030-19063-7_87
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Local Search Approaches in Stable Matching ProblemsAlgorithms, 2013
- Approximation algorithms for the sex-equal stable marriage problemACM Transactions on Algorithms, 2010
- The structure of stable marriage with indifferenceDiscrete Applied Mathematics, 2002
- Stable Marriage with Incomplete Lists and TiesLecture Notes in Computer Science, 1999
- Stable marriage and indifferenceDiscrete Applied Mathematics, 1994
- An efficient algorithm for the “optimal” stable marriageJournal of the ACM, 1987
- Three Fast Algorithms for Four Problems in Stable MarriageSIAM Journal on Computing, 1987
- An efficient algorithm for the “stable roommates” problemJournal of Algorithms, 1985
- The stable marriage problemCommunications of the ACM, 1971
- College Admissions and the Stability of MarriageThe American Mathematical Monthly, 1962