Pages that link to "Item:Q689901"

The following pages link to Complexity of the sex-equal stable marriage problem (Q689901):

Displaying 10 items.

• Sex-equal stable matchings: complexity and exact algorithms (Q528851) (← links)
• Approximability results for stable marriage problems with ties. (Q1426466) (← links)
• A collection of constraint programming models for the three-dimensional stable matching problem with cyclic preferences (Q2079273) (← links)
• Constrained stable marriage with free edges or few blocking pairs (Q2150572) (← links)
• The stable marriage problem: an interdisciplinary review from the physicist's perspective (Q2231919) (← links)
• Stable fractional matchings (Q2238635) (← links)
• Optimizing a generalized Gini index in stable marriage problems: NP-hardness, approximation and a polynomial time special case (Q2415359) (← links)
• On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization) (Q5062116) (← 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)