Pages that link to "Item:Q3819073"
From MaRDI portal
The following pages link to The Structure of the Stable Roommate Problem: Efficient Representation and Enumeration of All Stable Assignments (Q3819073):
Displaying 15 items.
- The complexity of approximately counting stable roommate assignments (Q440007) (← links)
- A unifying approach to the structures of the stable matching problems (Q808729) (← links)
- A maximum stable matching for the roommates problem (Q922705) (← links)
- Rotations in the stable \(b\)-matching problem (Q964393) (← links)
- Efficient algorithms for generalized stable marriage and roommates problems (Q995571) (← links)
- A bounded approximation for the minimum cost 2-sat problem (Q1193517) (← links)
- A new fixed point approach for stable networks and stable marriages (Q1201153) (← links)
- Network flow and 2-satisfiability (Q1317481) (← links)
- How to split the costs and charge the travellers sharing a ride? Aligning system's optimum with users' equilibrium (Q2140279) (← links)
- Subjective homophily and the fixtures problem (Q2221249) (← links)
- Compact linear programs for 2SAT (Q2311345) (← links)
- The cycle roommates problem: a hard case of kidney exchange (Q2379931) (← links)
- The stable fixtures problem -- a many-to-many extension of stable roommates (Q2384396) (← links)
- Two-Sided Matching Models (Q5150290) (← links)
- Recognizing when a preference system is close to admitting a master list (Q6124592) (← links)
