The following pages link to (Q4938640):
Displaying 34 items.
- A branch-and-price algorithm for stable workforce assignments with hierarchical skills (Q322747) (← links)
- A 25/17-approximation algorithm for the stable marriage problem with one-sided ties (Q528863) (← links)
- Better and simpler approximation algorithms for the stable marriage problem (Q547284) (← links)
- The Pareto-stability concept is a natural solution concept for discrete matching markets with indifferences (Q637586) (← links)
- Stable multi-skill workforce assignments (Q744637) (← links)
- The stable marriage problem with ties and restricted edges (Q783028) (← links)
- Characterization of super-stable matchings (Q832893) (← links)
- Improved approximation algorithms for two variants of the stable marriage problem with ties (Q896290) (← links)
- A \((2-c\frac{1}{\sqrt{N}})\)-approximation algorithm for the stable marriage problem (Q930600) (← links)
- The stable marriage problem with master preference lists (Q1005239) (← links)
- Stable marriage with ties and bounded length preference lists (Q1026229) (← links)
- Approximability results for stable marriage problems with ties. (Q1426466) (← links)
- Hard variants of stable marriage. (Q1605313) (← links)
- The structure of stable marriage with indifference (Q1613420) (← links)
- Satisfied two-sided matching: a method considering elation and disappointment of agents (Q1626247) (← links)
- Linear time local approximation algorithm for maximum stable marriage (Q1736578) (← links)
- Local search approaches in stable matching problems (Q1736586) (← links)
- Overlays with preferences: distributed, adaptive approximation algorithms for matching with preference lists (Q1736596) (← links)
- Randomized approximation of the stable marriage problem (Q1884845) (← links)
- Parameterized complexity and local search approaches for the stable marriage problem with ties (Q1959726) (← links)
- Housing markets through graphs (Q1959727) (← links)
- Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters (Q2105427) (← links)
- Solving hard stable matching problems involving groups of similar agents (Q2205948) (← links)
- Stable fractional matchings (Q2238635) (← links)
- Polynomial time algorithm for an optimal stable assignment with multiple partners (Q2373720) (← links)
- Pareto stability in two-sided many-to-many matching with weak preferences (Q2425160) (← links)
- On the number of employed in the matching model (Q2425191) (← links)
- Better and Simpler Approximation Algorithms for the Stable Marriage Problem (Q3541122) (← links)
- (Q5091034) (← links)
- A New Approach to the Pareto Stable Matching Problem (Q5244872) (← links)
- Maximum stable matching with one-sided ties of bounded length (Q5918705) (← links)
- Super-stability in the student-project allocation problem with ties (Q5918742) (← links)
- On the complexity of exchange-stable roommates (Q5957362) (← links)
- Stable matchings, one-sided ties, and approximate popularity (Q6547210) (← links)
