scientific article; zbMATH DE number 1405659
From MaRDI portal
Publication:4938640
Recommendations
- Stable marriage with ties and bounded length preference lists
- Stable marriages with restricted pairs
- The stable marriage problem with master preference lists
- Algorithms – ESA 2004
- The stable marriage problem with ties and restricted edges
- scientific article; zbMATH DE number 6672022
- Stable marriages with forced pairs and forbidden pairs
- The Complexity of Counting Stable Marriages
- On the uniqueness of stable marriage matchings
Cited in
(43)- The stable marriage problem with master preference lists
- Stable marriage with ties and bounded length preference lists
- Approximability results for stable marriage problems with ties.
- Hard variants of stable marriage.
- The structure of stable marriage with indifference
- Satisfied two-sided matching: a method considering elation and disappointment of agents
- Linear time local approximation algorithm for maximum stable marriage
- Local search approaches in stable matching problems
- Overlays with preferences: distributed, adaptive approximation algorithms for matching with preference lists
- Randomized approximation of the stable marriage problem
- Parameterized complexity and local search approaches for the stable marriage problem with ties
- Housing markets through graphs
- Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters
- Solving hard stable matching problems involving groups of similar agents
- Stable fractional matchings
- Polynomial time algorithm for an optimal stable assignment with multiple partners
- Pareto stability in two-sided many-to-many matching with weak preferences
- On the number of employed in the matching model
- scientific article; zbMATH DE number 2086256 (Why is no real title available?)
- A branch-and-price algorithm for stable workforce assignments with hierarchical skills
- Better and Simpler Approximation Algorithms for the Stable Marriage Problem
- An algorithm for the maximum weight strongly stable matching problem
- A new approach to the Pareto stable matching problem
- A 25/17-approximation algorithm for the stable marriage problem with one-sided ties
- Better and simpler approximation algorithms for the stable marriage problem
- Maximum stable matching with one-sided ties of bounded length
- Super-stability in the student-project allocation problem with ties
- On the complexity of exchange-stable roommates
- Hardness and approximation results for some variants of stable marriage problem
- The Pareto-stability concept is a natural solution concept for discrete matching markets with indifferences
- Stable matchings, one-sided ties, and approximate popularity
- Course allocation with credits via stable matching
- Structural aspects of the student project allocation problem
- A new heuristic algorithm for student-project allocation with lecturer preferences and ties
- Exact and approximate heuristics for the multi-modal stable matching with applications in industry chains
- Hardness and approximation results for some variants of stable marriage problem
- Stable marriage with multi-modal preferences
- A MaxSAT-based framework for computing circumscription
- Stable multi-skill workforce assignments
- The stable marriage problem with ties and restricted edges
- Characterization of super-stable matchings
- Improved approximation algorithms for two variants of the stable marriage problem with ties
- A \((2-c\frac{1}{\sqrt{N}})\)-approximation algorithm for the stable marriage problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4938640)
