Optimal stable matchings in Stable Roommates instances are fixed-parameter tractable parameterized by the minimum crossing distance to Stable Marriage instances.
Servedio, Ying Sheng, and Jinyu Xie
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DS 2years
2026 2representative citing papers
k-juntas, low-degree Fourier functions, and sparse polynomials are testable with O(1/ε) queries independent of n for small ε.
citing papers explorer
-
Bridging the Gap Between Stable Marriage and Stable Roommates: A Parameterized Algorithm for Optimal Stable Matchings
Optimal stable matchings in Stable Roommates instances are fixed-parameter tractable parameterized by the minimum crossing distance to Stable Marriage instances.
-
Classes Testable with $O(1/\epsilon)$ Queries for Small $\epsilon$ Independent of the Number of Variables
k-juntas, low-degree Fourier functions, and sparse polynomials are testable with O(1/ε) queries independent of n for small ε.