Pages that link to "Item:Q1736578"
From MaRDI portal
The following pages link to Linear time local approximation algorithm for maximum stable marriage (Q1736578):
Displaying 10 items.
- Characterization of super-stable matchings (Q832893) (← links)
- Improved approximation algorithms for two variants of the stable marriage problem with ties (Q896290) (← links)
- Linear time local approximation algorithm for maximum stable marriage (Q1736578) (← links)
- Editorial: Special issue on matching under preferences (Q1736613) (← links)
- Mathematical models for stable matching problems with ties and incomplete lists (Q1737478) (← links)
- Matching with indifferences: a comparison of algorithms in the context of course allocation (Q1753433) (← links)
- On the approximability of the stable matching problem with ties of size two (Q2196613) (← links)
- On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization) (Q5062116) (← links)
- A 3 / 2 -approximation Algorithm for the Student-Project Allocation Problem (Q5140716) (← links)
- Maximum stable matching with one-sided ties of bounded length (Q5918705) (← links)
