Pages that link to "Item:Q989570"
From MaRDI portal
The following pages link to An improved approximation lower bound for finding almost stable maximum matchings (Q989570):
Displaying 12 items.
- The hospitals/residents problem with lower quotas (Q261379) (← links)
- ``Almost stable'' matchings in the roommates problem with bounded preference lists (Q428844) (← links)
- Size versus stability in the marriage problem (Q964402) (← links)
- ``Almost-stable'' matchings in the hospitals/residents problem with couples (Q1701229) (← links)
- The stable roommates problem with short lists (Q1733384) (← links)
- Stable marriage and roommates problems with restricted edges: complexity and approximability (Q1751156) (← links)
- (Un)stable matchings with blocking costs (Q2060342) (← links)
- Solving hard stable matching problems involving groups of similar agents (Q2205948) (← links)
- The Stable Roommates Problem with Short Lists (Q2819460) (← links)
- Stable Marriage and Roommates Problems with Restricted Edges: Complexity and Approximability (Q3449578) (← links)
- How hard is it to satisfy (almost) all roommates (Q5002706) (← links)
- Computing relaxations for the three-dimensional stable matching problem with cyclic preferences (Q6073306) (← links)
