Pages that link to "Item:Q681890"
From MaRDI portal
The following pages link to Stable marriage with covering constraints -- a complete computational trichotomy (Q681890):
Displaying 13 items.
- Envy-free matchings with lower quotas (Q1986955) (← links)
- Constrained stable marriage with free edges or few blocking pairs (Q2150572) (← links)
- Non-existence of stable social groups in information-driven networks (Q2158297) (← links)
- Stable marriage with groups of similar agents (Q2190408) (← links)
- Solving hard stable matching problems involving groups of similar agents (Q2205948) (← links)
- Stable matchings with covering constraints: a complete computational trichotomy (Q2309466) (← links)
- Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers (Q2317862) (← links)
- How long does it take for all users in a social network to choose their communities? (Q2334040) (← links)
- A formal theory for the complexity class associated with the stable marriage problem (Q2915696) (← links)
- (Q3305724) (← links)
- How hard is it to satisfy (almost) all roommates (Q5002706) (← links)
- (Q5136288) (← links)
- Balanced stable marriage: how close is close enough? (Q5918373) (← links)
