Efficient algorithms for generalized stable marriage and roommates problems
From MaRDI portal
Publication:995571
DOI10.1016/J.TCS.2007.04.029zbMATH Open1190.90159DBLPjournals/tcs/FleinerIM07OpenAlexW1994939255WikidataQ57311971 ScholiaQ57311971MaRDI QIDQ995571FDOQ995571
David F. Manlove, Tamás Fleiner, Robert W. Irving
Publication date: 3 September 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.04.029
Recommendations
- An efficient algorithm for the “stable roommates” problem
- Better and simpler approximation algorithms for the stable marriage problem
- Better and Simpler Approximation Algorithms for the Stable Marriage Problem
- scientific article
- Stable marriage and roommates problems with restricted edges: complexity and approximability
- Stable marriage and roommates problems with restricted edges: complexity and approximability
- An approach to robustness in the stable roommates problem and its comparison with the stable marriage problem
- A maximum stable matching for the roommates problem
- Randomized approximation of the stable marriage problem
- Randomized approximation of the stable marriage problem
Cites Work
- NP-complete stable matching problems
- The Complexity of Counting Stable Marriages
- Three Fast Algorithms for Four Problems in Stable Marriage
- Title not available (Why is that?)
- Title not available (Why is that?)
- College Admissions and the Stability of Marriage
- On the Complexity of Timetable and Multicommodity Flow Problems
- Preference structures and their numerical representations
- Title not available (Why is that?)
- A necessary and sufficient condition for the existence of a complete stable matching
- An efficient algorithm for the “stable roommates” problem
- Pairwise kidney exchange
- Network flow and 2-satisfiability
- The Structure of the Stable Roommate Problem: Efficient Representation and Enumeration of All Stable Assignments
- Hard variants of stable marriage.
- The Stable Roommates Problem with Ties
- Stable marriage and indifference
- The structure of stable marriage with indifference
- Title not available (Why is that?)
- Approximability results for stable marriage problems with ties.
- The stable marriage problem with restricted pairs.
- Title not available (Why is that?)
- A new fixed point approach for stable networks and stable marriages
- Lower Bounds for the Stable Marriage Problem and Its Variants
- On a generalization of the stable roommates problem
- The set of super-stable marriages forms a distributive lattice
- A New Approach to Stable Matching Problems
Cited In (16)
- Characterization of super-stable matchings
- The Structure of the Stable Roommate Problem: Efficient Representation and Enumeration of All Stable Assignments
- Pairwise Preferences in the Stable Marriage Problem
- Title not available (Why is that?)
- New and simple algorithms for stable flow problems
- Stable matchings with covering constraints: a complete computational trichotomy
- Stable multi-skill workforce assignments
- Planar Matchings for Weighted Straight Skeletons
- The core of housing markets from an agent's perspective: Is it worth sprucing up your home?
- Adapting stable matchings to forced and forbidden pairs
- An efficient algorithm for the “stable roommates” problem
- Planar Matchings for Weighted Straight Skeletons
- The stable marriage problem with ties and restricted edges
- An algorithm for a super-stable roommates problem
- Stable Marriage and Roommates Problems with Restricted Edges: Complexity and Approximability
- Stable marriage and roommates problems with restricted edges: complexity and approximability
This page was built for publication: Efficient algorithms for generalized stable marriage and roommates problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q995571)
