Hardness and approximation results for some variants of stable marriage problem

DOI10.1007/978-3-030-95018-7_20OpenAlexW4206928126MaRDI QIDQ6102281

Sachin, B. S. Panda

Publication date: 8 May 2023

Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-95018-7_20

zbMATH Keywords

approximation algorithmpolynomial time algorithmNP-completestable matching

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Stable marriage with ties and bounded length preference lists
• Stable marriage and indifference
• Approximability results for stable marriage problems with ties.
• Hard variants of stable marriage.
• Linear time local approximation algorithm for maximum stable marriage
• Faster and simpler approximation of stable matchings
• Minimum Edge Dominating Sets
• Edge Dominating Sets in Graphs
• College Admissions and the Stability of Marriage

This page was built for publication: Hardness and approximation results for some variants of stable marriage problem