On the complexity of stable hypergraph matching, stable multicommodity flow and related problems

DOI10.1016/j.tcs.2022.07.025OpenAlexW4288737354MaRDI QIDQ2167893

Gergely Csáji

Publication date: 1 September 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.07.025

zbMATH Keywords

stable matchinghospitals/residents problemPPADstable flowstable hypergraph matching

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Matching couples with Scarf's algorithm
• Keeping partners together: Algorithmic results for the hospitals/residents problem with couples
• On the complexity of the parity argument and other inefficient proofs of existence
• On a lemma of Scarf.
• Stable multicommodity flows
• On Stable Matchings and Flows
• Three-Dimensional Stabl Matching Problems
• Two’s Company, Three’s a Crowd: Stable Family and Threesome Roommates Problems
• On the complexity of stable fractional hypergraph matching
• Reducibility among Fractional Stability Problems
• The Core of an N Person Game
• College Admissions and the Stability of Marriage
• New and simple algorithms for stable flow problems