Stable assignment with couples: parameterized complexity and local search
From MaRDI portal
(Redirected from Publication:456691)
Recommendations
- Stable assignment with couples: parameterized complexity and local search
- Keeping partners together: Algorithmic results for the hospitals/residents problem with couples
- Stable matching with couples: an empirical study
- ``Almost-stable matchings in the hospitals/residents problem with couples
- Stable matchings with couples
Cites work
- scientific article; zbMATH DE number 48303 (Why is no real title available?)
- scientific article; zbMATH DE number 1973378 (Why is no real title available?)
- scientific article; zbMATH DE number 1445319 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- A parameterized view on matroid optimization problems
- An efficient algorithm for the “stable roommates” problem
- College Admissions and the Stability of Marriage
- Color-coding
- Hard variants of stable marriage.
- Keeping partners together: Algorithmic results for the hospitals/residents problem with couples
- Matching with sizes (or scheduling with processing set restrictions)
- NP-complete stable matching problems
- On miniaturized problems in parameterized complexity theory
- On the Hardness of Losing Weight
- Parallel machine scheduling with job assignment restrictions
- Searching the \(k\)-change neighborhood for TSP is W[1]-hard
- Some remarks on the stable matching problem
- Stability of matchings when individuals have preferences over colleagues
- Stable matchings and preferences of couples
- The Lattice Structure of the Set of Stable Matchings with Multiple Partners
- The Stable Roommates Problem with Ties
Cited in
(25)- On the parameterized complexity of consensus clustering
- Envy-freeness and relaxed stability for lower-quotas: a parameterized perspective
- Local search for string problems: brute-force is essentially optimal
- Backdoors to satisfaction
- Keeping partners together: Algorithmic results for the hospitals/residents problem with couples
- Scheduling and fixed-parameter tractability
- Polynomial time algorithm for an optimal stable assignment with multiple partners
- Parameterized complexity of machine scheduling: 15 open problems
- The parameterized complexity of local search for TSP, more refined
- Matching with couples: a multidisciplinary survey
- Local search approaches in stable matching problems
- Stable matching games: manipulation via subgraph isomorphism
- How hard is it to satisfy (almost) all roommates?
- Balanced stable marriage: how close is close enough?
- Matching couples with Scarf's algorithm
- Coupled and k-Sided Placements: Generalizing Generalized Assignment
- Matching with sizes (or scheduling with processing set restrictions)
- Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters
- Searching for better fill-in
- Sex-equal stable matchings: complexity and exact algorithms
- ``Almost-stable matchings in the hospitals/residents problem with couples
- Stable matchings with covering constraints: a complete computational trichotomy
- Perfect matching in bipartite hypergraphs subject to a demand graph
- Parameterized complexity and local search approaches for the stable marriage problem with ties
- Stable assignment with couples: parameterized complexity and local search
This page was built for publication: Stable assignment with couples: parameterized complexity and local search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q456691)
