Pages that link to "Item:Q3638073"
From MaRDI portal
The following pages link to A 3/2-Approximation Algorithm for General Stable Marriage (Q3638073):
Displayed 20 items.
- Stable marriage with general preferences (Q506532) (← 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)
- Characterization of super-stable matchings (Q832893) (← links)
- Improved approximation algorithms for two variants of the stable marriage problem with ties (Q896290) (← links)
- Parameterized algorithms for stable matching with ties and incomplete lists (Q1708024) (← 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)
- Mathematical models for stable matching problems with ties and incomplete lists (Q1737478) (← links)
- Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters (Q2105427) (← 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)
- On the number of employed in the matching model (Q2425191) (← links)
- On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization) (Q5062116) (← links)
- New Algorithms for Edge Induced König-Egerváry Subgraph Based on Gallai-Edmonds Decomposition (Q5091022) (← links)
- (Q5091034) (← links)
- Maximum stable matching with one-sided ties of bounded length (Q5918705) (← links)