Pages that link to "Item:Q1026229"
From MaRDI portal
The following pages link to Stable marriage with ties and bounded length preference lists (Q1026229):
Displayed 19 items.
- A 25/17-approximation algorithm for the stable marriage problem with one-sided ties (Q528863) (← links)
- The stable marriage problem with ties and restricted edges (Q783028) (← links)
- Keeping partners together: Algorithmic results for the hospitals/residents problem with couples (Q975759) (← links)
- Parameterized algorithms for stable matching with ties and incomplete lists (Q1708024) (← links)
- Mathematical models for stable matching problems with ties and incomplete lists (Q1737478) (← links)
- Stable marriage and roommates problems with restricted edges: complexity and approximability (Q1751156) (← links)
- Strongly stable and maximum weakly stable noncrossing matchings (Q1979449) (← links)
- Improving solution times for stable matching problems through preprocessing (Q2027037) (← links)
- Stable fractional matchings (Q2238635) (← links)
- Stable matchings with covering constraints: a complete computational trichotomy (Q2309466) (← links)
- Borda-induced hedonic games with friends, enemies, and neutral players (Q2317997) (← links)
- Two hardness results for core stability in hedonic coalition formation games (Q2446827) (← links)
- On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization) (Q5062116) (← links)
- A General Framework for Stable Roommates Problems using Answer Set Programming (Q5140025) (← links)
- Balanced stable marriage: how close is close enough? (Q5918373) (← links)
- Maximum stable matching with one-sided ties of bounded length (Q5918705) (← links)
- Strategyproof mechanism for two-sided matching with resource allocation (Q6098859) (← links)
- Hardness and approximation results for some variants of stable marriage problem (Q6102281) (← links)
- Optimal cost-based allocations under two-sided preferences (Q6182910) (← links)