Modifying an instance of the super-stable matching problem

DOI10.1016/J.IPL.2024.106549MaRDI QIDQ7013209zbMATH OpenFDO

Authors Naoyuki Kamiyama

Publication date 13 March 2025

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.IPL.2024.106549

zbMATH Keywords

matchingmodificationsuper-stability

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• A matroid generalization of the super-stable matching problem
• A maximum stable matching for the roommates problem
• Algorithmics of matching under preferences. With a foreword by Kurt Mehlhorn
• An optimal algorithm for the popular condensation problem
• Approximation and Online Algorithms
• College Admissions and the Stability of Marriage
• scientific article; zbMATH DE number 1617265 (Why is no real title available?)
• Reducibility among combinatorial problems
• Stable marriage and indifference
• Stable matchings with ties, master preference lists, and matroid constraints
• Super-stability in the student-project allocation problem with ties
• The generalized popular condensation problem
• The stable marriage problem with master preference lists
• The Stable Roommates Problem with Ties

This page was built for publication: Modifying an instance of the super-stable matching problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7013209)