scientific article; zbMATH DE number 1369412
From MaRDI portal
Publication:4704591
zbMATH Open0940.05065MaRDI QIDQ4704591FDOQ4704591
Tuukka Lindberg, Erkki Mäkinen, Eija Kujansuu
Publication date: 19 July 2000
Full work available at URL: https://eudml.org/doc/48463
Title of this publication is not available (Why is that?)
Recommendations
- Weighted Matching in Chess Tournaments
- An efficient algorithm for the “stable roommates” problem
- The Structure of the Stable Roommate Problem: Efficient Representation and Enumeration of All Stable Assignments
- The stable fixtures problem -- a many-to-many extension of stable roommates
- The stable crews problem
Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (15)
- The Stable Roommates Problem with Ties
- The stable roommates problem with short lists
- A new solution concept for the roommate problem: \(\mathcal{Q}\)-stable matchings
- On the number of single-peaked narcissistic or single-crossing narcissistic preference profiles
- An efficient implementation of the Gale and Shapley “propose-and-reject” algorithm
- Size versus stability in the marriage problem
- A General Framework for Stable Roommates Problems using Answer Set Programming
- Size Versus Stability in the Marriage Problem
- The Stable Roommates Problem with Short Lists
- How hard is it to satisfy (almost) all roommates
- The stable marriage problem: an interdisciplinary review from the physicist's perspective
- On the complexity of distributed stable matching with small messages
- Efficient algorithms for generalized stable marriage and roommates problems
- Review of the theory of stable matchings and contract systems
- League competitions and fairness
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4704591)
