An algorithm for a super-stable roommates problem
DOI10.1016/J.TCS.2011.09.012zbMATH Open1227.05233OpenAlexW2071068919MaRDI QIDQ650948FDOQ650948
Robert W. Irving, David F. Manlove, Tamás Fleiner
Publication date: 7 December 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.09.012
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Matching models (91B68)
Cites Work
- NP-complete stable matching problems
- College Admissions and the Stability of Marriage
- On a lemma of Scarf.
- A necessary and sufficient condition for the existence of a complete stable matching
- An efficient algorithm for the “stable roommates” problem
- The Stable Roommates Problem with Ties
- The stable marriage problem with restricted pairs.
- Efficient algorithms for generalized stable marriage and roommates problems
Cited In (7)
- A maximum stable matching for the roommates problem
- A note on roommate problems with a limited number of rooms
- A General Framework for Stable Roommates Problems using Answer Set Programming
- Stable Roommates and Constraint Programming
- Computing relaxations for the three-dimensional stable matching problem with cyclic preferences
- An efficient algorithm for the “stable roommates” problem
- The stable marriage problem with ties and restricted edges
This page was built for publication: An algorithm for a super-stable roommates problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q650948)
