Searching for "Stable Matching Problems." – sorted by Relevance.
-
Specialised constraints for stable matching problems
- Specialised Constraints for Stable Matching Problems ⋆ Chris Unsworth Department of Computing
- Cited by 1 (1 self) – Add To MetaCart
-
Distributed stable matching problems with ties and incomplete lists
- Distributed Stable Matching Problems with Ties and Incomplete Lists Ismel Brito and Pedro Meseguer
- Cited by 2 (1 self) – Add To MetaCart
-
Three-dimensional Stable Matching Problems
- Three-dimensional Stable Matching Problems Cheng Ng and Daniel S. Hirschberg Department
- Cited by 8 (0 self) – Add To MetaCart
-
unknown title
- Ming In this lecture, we proved that the bipartite matching and the stable matching problems can
- Add To MetaCart
-
A Unified Approach to Finding Good Stable Matchings in the Hospitals/Residents Setting
- problem is to find a matching that is stable – one that has no blocking pairs. In their seminal paper [6
- Add To MetaCart
-
A Sublinear Parallel Algorithm for Stable Matching
- . Plotkin z Abstract. Parallel algorithms for various versions of the stable matching problem are presented
- Cited by 6 (0 self) – Add To MetaCart
-
A Constraint Programming Approach to the
- to the domain of stable matching problems in general, many of which are NP-hard. I Introduction An instance
- Add To MetaCart
-
Finding a maximum weight triangle in n 3−δ time, with applications
- )k 2 ) = Õ(n2.688k ) time. We give applications to a variety of problems, including a stable matching
- Cited by 9 (5 self) – Add To MetaCart
-
An Empirical Study of the Stable Marriage Problem with
- decision problem "Is there a stable matching of size n?" and the optimisation problem, to find the largest
- Add To MetaCart
-
An Empirical Study of the Stable Marriage Problem with Ties and Incomplete Lists
- decision problem "Is there a stable matching of size n?" and the optimisation problem, to find the largest
- Cited by 13 (3 self) – Add To MetaCart

