STACS 2004
From MaRDI portal
Recommendations
Cited in
(19)- The stable marriage problem with master preference lists
- Equivalence of two-sided stable matching
- ``Almost-stable matchings in the hospitals/residents problem with couples
- An efficient algorithm for batch stability testing
- Improving solution times for stable matching problems through preprocessing
- A faster algorithm for the Strongly Stable b-Matching Problem
- scientific article; zbMATH DE number 1617265 (Why is no real title available?)
- Revisiting two-sided stability constraints
- Strongly stable matchings in time \(O(nm)\) and extension to the hospitals-residents problem
- Stable matchings with ties, master preference lists, and matroid constraints
- Strongly stable assignment
- scientific article; zbMATH DE number 1962834 (Why is no real title available?)
- Characterisation of strongly stable matchings
- The strongly stable roommates problem
- An algorithm for the maximum weight strongly stable matching problem
- A computational approach to the multi-period many-to-one matching with ties
- Algorithms – ESA 2004
- A \((2-c\frac{1}{\sqrt{N}})\)-approximation algorithm for the stable marriage problem
- A unified approach to finding good stable matchings in the hospitals/residents setting
This page was built for publication: STACS 2004
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5309702)