A (1 + 1/e)-approximation algorithm for maximum stable matching with one-sided ties and incomplete lists

From MaRDI portal
(Redirected from Publication:5236366)
A \((1 + 1/e)\)-approximation algorithm for maximum stable matching with one-sided ties and incomplete lists


DOI10.1137/1.9781611975482.175MaRDI QIDQ5236366zbMATH OpenOpenAlexFDO

Authors Chi-Kit Lam, C. G. Plaxton

Publication date 15 October 2019

Published in Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611975482.175


Mathematics Subject Classification ID

Approximation algorithms (68W25) Matching models (91B68)




Recommendations



Cited in
(7)








This page was built for publication: A \((1 + 1/e)\)-approximation algorithm for maximum stable matching with one-sided ties and incomplete lists

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=A_%5C((1_%2B_1/e)%5C)-approximation_algorithm_for_maximum_stable_matching_with_one-sided_ties_and_incomplete_lists&oldid=100505651"
Powered by MediaWiki