The following pages link to (Q2934607):
Displayed 13 items.
- A 25/17-approximation algorithm for the stable marriage problem with one-sided ties (Q528863) (← links)
- Better and simpler approximation algorithms for the stable marriage problem (Q547284) (← links)
- Improved approximation algorithms for two variants of the stable marriage problem with ties (Q896290) (← links)
- Stable marriage with ties and bounded length preference lists (Q1026229) (← links)
- Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems (Q1029707) (← links)
- Linear time local approximation algorithm for maximum stable marriage (Q1736578) (← links)
- Local search approaches in stable matching problems (Q1736586) (← links)
- Faster and simpler approximation of stable matchings (Q1736612) (← links)
- On the approximability of the stable matching problem with ties of size two (Q2196613) (← links)
- The stable marriage problem: an interdisciplinary review from the physicist's perspective (Q2231919) (← links)
- Pareto stability in two-sided many-to-many matching with weak preferences (Q2425160) (← links)
- Better and Simpler Approximation Algorithms for the Stable Marriage Problem (Q3541122) (← links)
- Maximum stable matching with one-sided ties of bounded length (Q5918705) (← links)