Pages that link to "Item:Q440007"
From MaRDI portal
The following pages link to The complexity of approximately counting stable roommate assignments (Q440007):
Displaying 7 items.
- The complexity of approximately counting stable matchings (Q441846) (← links)
- Stable matching of student-groups to dormitories (Q2140313) (← links)
- Stable marriage with groups of similar agents (Q2190408) (← links)
- Solving hard stable matching problems involving groups of similar agents (Q2205948) (← links)
- The stable fixtures problem -- a many-to-many extension of stable roommates (Q2384396) (← links)
- A number of stable matchings in models of the Gale-Shapley type (Q2446884) (← links)
- An efficient algorithm for the “stable roommates” problem (Q3703906) (← links)