A faster algorithm for the Strongly Stable b-Matching Problem

DOI10.1007/978-3-030-17402-6_25MaRDI QIDQ2294060zbMATH OpenOpenAlexFDO

Authors Adam Kunysz

Publication date 6 February 2020

Full work available at URL https://doi.org/10.1007/978-3-030-17402-6_25

zbMATH Keywords

\(b\)-matchingstable marriagestrongly stable matching

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• STACS 2004
• Strongly stable matchings in time \(O(nm)\) and extension to the hospitals-residents problem
• An algorithm for the maximum weight strongly stable matching problem
• Characterisation of strongly stable matchings
• The strongly stable roommates problem

Cited in

(6)

• A self-stabilizing algorithm for b-matching
• Faster and simpler approximation of stable matchings
• An algorithm for the maximum weight strongly stable matching problem
• Strongly stable matchings under matroid constraints
• The strongly stable matching problem with closures
• Characterization of super-stable matchings

This page was built for publication: A faster algorithm for the Strongly Stable \(b\)-Matching Problem

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