Stable assignment with couples: parameterized complexity and local search
From MaRDI portal
Publication:456691
DOI10.1016/J.DISOPT.2010.07.004zbMATH Open1248.90058OpenAlexW2037963188MaRDI QIDQ456691FDOQ456691
Authors: Dániel Marx, Ildikó Schlotter 
Publication date: 16 October 2012
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2010.07.004
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
Abstract computational complexity for mathematical programming problems (90C60) Discrete location and assignment (90B80)
Cites Work
- Title not available (Why is that?)
- Some remarks on the stable matching problem
- NP-complete stable matching problems
- Color-coding
- Title not available (Why is that?)
- College Admissions and the Stability of Marriage
- Keeping partners together: Algorithmic results for the hospitals/residents problem with couples
- 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
- Title not available (Why is that?)
- Parallel machine scheduling with job assignment restrictions
- An efficient algorithm for the “stable roommates” problem
- Searching the \(k\)-change neighborhood for TSP is W[1]-hard
- On miniaturized problems in parameterized complexity theory
- On the Hardness of Losing Weight
- A parameterized view on matroid optimization problems
- Hard variants of stable marriage.
- The Stable Roommates Problem with Ties
- Title not available (Why is that?)
- Matching with sizes (or scheduling with processing set restrictions)
Cited In (25)
- Local search for string problems: brute-force is essentially optimal
- Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters
- Polynomial time algorithm for an optimal stable assignment with multiple partners
- Envy-freeness and relaxed stability for lower-quotas: a parameterized perspective
- Coupled and k-Sided Placements: Generalizing Generalized Assignment
- Searching for better fill-in
- Keeping partners together: Algorithmic results for the hospitals/residents problem with couples
- Parameterized complexity of machine scheduling: 15 open problems
- Stable matching games: manipulation via subgraph isomorphism
- Stable matchings with covering constraints: a complete computational trichotomy
- Backdoors to satisfaction
- Matching couples with Scarf's algorithm
- Matching with sizes (or scheduling with processing set restrictions)
- Stable assignment with couples: parameterized complexity and local search
- On the parameterized complexity of consensus clustering
- Scheduling and fixed-parameter tractability
- Local search approaches in stable matching problems
- How hard is it to satisfy (almost) all roommates
- Perfect matching in bipartite hypergraphs subject to a demand graph
- Balanced stable marriage: how close is close enough?
- Parameterized complexity and local search approaches for the stable marriage problem with ties
- The parameterized complexity of local search for TSP, more refined
- Matching with couples: a multidisciplinary survey
- ``Almost-stable matchings in the hospitals/residents problem with couples
- Sex-equal stable matchings: complexity and exact algorithms
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)
