The following pages link to Hard variants of stable marriage. (Q1605313):
Displaying 50 items.
- Stable assignment with couples: parameterized complexity and local search (Q456691) (← links)
- 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)
- The stable marriage problem with ties and restricted edges (Q783028) (← links)
- Improved approximation algorithms for two variants of the stable marriage problem with ties (Q896290) (← links)
- Two algorithms for the student-project allocation problem (Q924544) (← links)
- A \((2-c\frac{1}{\sqrt{N}})\)-approximation algorithm for the stable marriage problem (Q930600) (← links)
- Size versus stability in the marriage problem (Q964402) (← links)
- Efficient assignment respecting priorities (Q972883) (← links)
- The college admissions problem with lower and common quotas (Q986550) (← links)
- Efficient algorithms for generalized stable marriage and roommates problems (Q995571) (← links)
- The stable marriage problem with master preference lists (Q1005239) (← links)
- Stable marriage with ties and bounded length preference lists (Q1026229) (← links)
- Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems (Q1029707) (← links)
- Approximability results for stable marriage problems with ties. (Q1426466) (← links)
- Hard variants of stable marriage. (Q1605313) (← links)
- The structure of stable marriage with indifference (Q1613420) (← links)
- Satisfied two-sided matching: a method considering elation and disappointment of agents (Q1626247) (← links)
- Parameterized algorithms for stable matching with ties and incomplete lists (Q1708024) (← links)
- The stable tournament problem: matching sports schedules with preferences (Q1728308) (← links)
- The stable roommates problem with short lists (Q1733384) (← links)
- Linear time local approximation algorithm for maximum stable marriage (Q1736578) (← links)
- Local search approaches in stable matching problems (Q1736586) (← links)
- Overlays with preferences: distributed, adaptive approximation algorithms for matching with preference lists (Q1736596) (← links)
- Faster and simpler approximation of stable matchings (Q1736612) (← 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)
- Randomized approximation of the stable marriage problem (Q1884845) (← links)
- Three-sided stable matchings with cyclic preferences (Q1959723) (← links)
- Parameterized complexity and local search approaches for the stable marriage problem with ties (Q1959726) (← links)
- Improving solution times for stable matching problems through preprocessing (Q2027037) (← links)
- Complexity of finding Pareto-efficient allocations of highest welfare (Q2030716) (← links)
- Stable matching with uncertain pairwise preferences (Q2078608) (← links)
- Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters (Q2105427) (← links)
- Constrained stable marriage with free edges or few blocking pairs (Q2150572) (← links)
- Stable marriage with groups of similar agents (Q2190408) (← links)
- Robust and approximately stable marriages under partial information (Q2190410) (← links)
- On the approximability of the stable matching problem with ties of size two (Q2196613) (← links)
- Solving hard stable matching problems involving groups of similar agents (Q2205948) (← links)
- The stable marriage problem: an interdisciplinary review from the physicist's perspective (Q2231919) (← links)
- Stable fractional matchings (Q2238635) (← links)
- Borda-induced hedonic games with friends, enemies, and neutral players (Q2317997) (← links)
- Pareto stability in two-sided many-to-many matching with weak preferences (Q2425160) (← links)
- Deferred acceptance algorithms: history, theory, practice, and open questions (Q2482681) (← links)
- Testing substitutability of weak preferences (Q2637415) (← links)
- Mixed-integer formulations for the capacitated rank pricing problem with envy (Q2669780) (← links)
- Marriage market with indifferences: a linear programming approach (Q2687690) (← links)
- Finding All Stable Pairs and Solutions to the Many-to-Many Stable Matching Problem (Q2815443) (← links)
- The Stable Roommates Problem with Short Lists (Q2819460) (← links)
