Pages that link to "Item:Q1029707"
From MaRDI portal
The following pages link to Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems (Q1029707):
Displaying 19 items.
- Integer programming methods for special college admissions problems (Q346530) (← links)
- 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)
- The stable marriage problem with master preference lists (Q1005239) (← links)
- Stable marriage with ties and bounded length preference lists (Q1026229) (← links)
- Approximability results for stable marriage problems with ties. (Q1426466) (← links)
- Hard variants of stable marriage. (Q1605313) (← links)
- ``Almost-stable'' matchings in the hospitals/residents problem with couples (Q1701229) (← links)
- Linear time local approximation algorithm for maximum stable marriage (Q1736578) (← links)
- Local search approaches in stable matching problems (Q1736586) (← links)
- Mathematical models for stable matching problems with ties and incomplete lists (Q1737478) (← links)
- Parameterized complexity and local search approaches for the stable marriage problem with ties (Q1959726) (← links)
- College admissions with ties and common quotas: integer programming approach (Q2077946) (← links)
- Robust and approximately stable marriages under partial information (Q2190410) (← links)
- The stable marriage problem: an interdisciplinary review from the physicist's perspective (Q2231919) (← links)
- Better and Simpler Approximation Algorithms for the Stable Marriage Problem (Q3541122) (← links)
- Finding strongly popular \(b\)-matchings in bipartite graphs (Q5918874) (← links)
- Stable matchings, one-sided ties, and approximate popularity (Q6547210) (← links)
