Pages that link to "Item:Q547284"
From MaRDI portal
The following pages link to Better and simpler approximation algorithms for the stable marriage problem (Q547284):
Displayed 17 items.
- Improved approximation bounds for the student-project allocation problem with preferences over projects (Q450528) (← links)
- A 25/17-approximation algorithm for the stable marriage problem with one-sided ties (Q528863) (← links)
- Improved approximation algorithms for two variants of the stable marriage problem with ties (Q896290) (← links)
- Application of pair approximation method to modeling and analysis of a marriage network (Q1734321) (← links)
- Maximum locally stable matchings (Q1736563) (← 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)
- Student-project allocation with preferences over projects: algorithmic and experimental results (Q2064298) (← links)
- On the approximability of the stable matching problem with ties of size two (Q2196613) (← links)
- On the number of employed in the matching model (Q2425191) (← links)
- Improved Approximation Bounds for the Student-Project Allocation Problem with Preferences over Projects (Q3010424) (← links)
- On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization) (Q5062116) (← links)
- (Q5091034) (← links)
- Popular Matchings with Lower Quotas (Q5136336) (← links)
- (Q5743383) (← links)
- Maximum stable matching with one-sided ties of bounded length (Q5918705) (← links)