Pages that link to "Item:Q1736612"
From MaRDI portal
The following pages link to Faster and simpler approximation of stable matchings (Q1736612):
Displayed 7 items.
- Characterization of super-stable matchings (Q832893) (← links)
- Mathematical models for stable matching problems with ties and incomplete lists (Q1737478) (← links)
- On the approximability of the stable matching problem with ties of size two (Q2196613) (← links)
- (Q5091034) (← links)
- Collapsing Superstring Conjecture (Q5875478) (← links)
- Maximum stable matching with one-sided ties of bounded length (Q5918705) (← links)
- Hardness and approximation results for some variants of stable marriage problem (Q6102281) (← links)