Pages that link to "Item:Q5002706"
From MaRDI portal
The following pages link to How hard is it to satisfy (almost) all roommates (Q5002706):
Displaying 8 items.
- The stable roommates problem with short lists (Q1733384) (← links)
- Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters (Q2105427) (← links)
- Solving hard stable matching problems involving groups of similar agents (Q2205948) (← links)
- On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization) (Q5062116) (← links)
- (Q5075765) (← links)
- Balanced stable marriage: how close is close enough? (Q5918373) (← links)
- Computing relaxations for the three-dimensional stable matching problem with cyclic preferences (Q6073306) (← links)
- Envy-freeness and relaxed stability for lower-quotas: a parameterized perspective (Q6162047) (← links)