Balanced stable marriage: how close is close enough?
From MaRDI portal
Publication:5918373
DOI10.1016/j.tcs.2021.05.015OpenAlexW3177403889MaRDI QIDQ5918373
Sushmita Gupta, Sanjukta Roy, Meirav Zehavi, Saket Saurabh
Publication date: 27 August 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1707.09545
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Fundamentals of parameterized complexity
- ``Almost stable matchings in the roommates problem with bounded preference lists
- Stable assignment with couples: parameterized complexity and local search
- Sex-equal stable matchings: complexity and exact algorithms
- Fixed-parameter tractability and completeness II: On completeness for W[1]
- Group activity selection on graphs: parameterized analysis
- Stable marriage with covering constraints -- a complete computational trichotomy
- Complexity of the sex-equal stable marriage problem
- Elicitation strategies for soft constraint problems with missing preferences: properties, algorithms and experimental studies
- Stable marriage with ties and bounded length preference lists
- Some remarks on the stable matching problem
- Hard variants of stable marriage.
- Improving man-optimal stable matchings by minimum change of preference lists
- Towards a dichotomy for the possible winner problem in elections based on scoring rules
- Parameterized complexity and local search approaches for the stable marriage problem with ties
- Stable marriage with groups of similar agents
- On Multiway Cut Parameterized above Lower Bounds
- Studies in Computational Aspects of Voting
- The Hospitals/Residents Problem with Quota Lower Bounds
- Paths, Flowers and Vertex Cover
- Three Fast Algorithms for Four Problems in Stable Marriage
- Raising The Bar For V<scp>ertex</scp> C<scp>over</scp>: Fixed-parameter Tractability Above A Higher Guarantee
- Stable networks and product graphs
- Faster Parameterized Algorithms Using Linear Programming
- How hard is it to satisfy (almost) all roommates
- Handbook of Computational Social Choice
- Algorithmics of Matching Under Preferences
- Parameterized Algorithms
- Approximation and Online Algorithms
- College Admissions and the Stability of Marriage
This page was built for publication: Balanced stable marriage: how close is close enough?
