Pages that link to "Item:Q1426466"

The following pages link to Approximability results for stable marriage problems with ties. (Q1426466):

Displaying 17 items.

• Better and simpler approximation algorithms for the stable marriage problem (Q547284) (← links)
• A \((2-c\frac{1}{\sqrt{N}})\)-approximation algorithm for the stable marriage problem (Q930600) (← links)
• Efficient algorithms for generalized stable marriage and roommates problems (Q995571) (← links)
• Student-project allocation with preferences over projects (Q1002100) (← 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)
• 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)
• Parameterized complexity and local search approaches for the stable marriage problem with ties (Q1959726) (← links)
• A collection of constraint programming models for the three-dimensional stable matching problem with cyclic preferences (Q2079273) (← links)
• Better and Simpler Approximation Algorithms for the Stable Marriage Problem (Q3541122) (← links)
• How hard is it to satisfy (almost) all roommates (Q5002706) (← links)
• On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization) (Q5062116) (← links)
• Maximum stable matching with one-sided ties of bounded length (Q5918705) (← links)
• Review of the theory of stable matchings and contract systems (Q6039790) (← links)