Pages that link to "Item:Q1736612"

The following pages link to Faster and simpler approximation of stable matchings (Q1736612):

Displaying 22 items.

• The complexity of approximately counting stable matchings (Q441846) (← links)
• Characterization of super-stable matchings (Q832893) (← links)
• An algorithm to compute the full set of many-to-many stable matchings. (Q1431789) (← links)
• Parameterized algorithms for stable matching with ties and incomplete lists (Q1708024) (← links)
• Improving man-optimal stable matchings by minimum change of preference lists (Q1736562) (← links)
• Linear time local approximation algorithm for maximum stable marriage (Q1736578) (← links)
• Mathematical models for stable matching problems with ties and incomplete lists (Q1737478) (← links)
• Almost stable matchings by truncating the Gale-Shapley algorithm (Q1959728) (← links)
• Faster algorithms for stable allocation problems (Q1959735) (← links)
• Faster algorithm for finding maximum 1-restricted simple 2-matchings (Q2169943) (← links)
• On the approximability of the stable matching problem with ties of size two (Q2196613) (← links)
• Subquadratic algorithms for succinct stable matching (Q2415371) (← links)
• Disjoint stable matchings in linear time (Q2672428) (← links)
• Fast distributed almost stable matchings (Q2796247) (← links)
• Finding a minimum-regret many-to-many Stable Matching (Q2868914) (← links)
• (Q2963917) (← links)
• The Complexity of Approximately Counting Stable Matchings (Q3588401) (← links)
• (Q5091034) (← links)
• Legal Assignments and Fast EADAM with Consent via Classic Theory of Stable Matchings (Q5095181) (← links)
• Stochastic Matching with Few Queries: New Algorithms and Tools (Q5236368) (← links)
• Collapsing Superstring Conjecture (Q5875478) (← links)
• Maximum stable matching with one-sided ties of bounded length (Q5918705) (← links)