{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T14:00:56Z","timestamp":1781272856175,"version":"3.54.1"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,5,19]],"date-time":"2022-05-19T00:00:00Z","timestamp":1652918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,5,19]],"date-time":"2022-05-19T00:00:00Z","timestamp":1652918400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1007\/s00224-022-10072-1","type":"journal-article","created":{"date-parts":[[2022,5,19]],"date-time":"2022-05-19T13:03:41Z","timestamp":1652965421000},"page":"645-678","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Maximum Stable Matching with One-Sided Ties of Bounded Length"],"prefix":"10.1007","volume":"66","author":[{"given":"Chi-Kit","family":"Lam","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7084-1612","authenticated-orcid":false,"given":"C. Gregory","family":"Plaxton","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,5,19]]},"reference":[{"key":"10072_CR1","doi-asserted-by":"crossref","unstructured":"Lam, C-K, Plaxton, C.G.: A (1 + 1\/e)-approximation algorithm for maximum stable matching with one-sided ties and incomplete lists. In: Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms, pp 2823\u20132840 (2019)","DOI":"10.1137\/1.9781611975482.175"},{"key":"10072_CR2","doi-asserted-by":"crossref","unstructured":"Lam, C-K, Plaxton, C.G.: Maximum stable matching with one-sided ties of bounded length. In: Proceedings of the 12th International Symposium on Algorithmic Game Theory, pp 343\u2013356 (2019)","DOI":"10.1007\/978-3-030-30473-7_23"},{"issue":"1","key":"10072_CR3","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1080\/00029890.1962.11989827","volume":"69","author":"D Gale","year":"1962","unstructured":"Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Amer. Math. Monthly 69(1), 9\u201315 (1962)","journal-title":"Amer. Math. Monthly"},{"issue":"3","key":"10072_CR4","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0166-218X(92)00179-P","volume":"48","author":"RW Irving","year":"1994","unstructured":"Irving, R.W.: Stable marriage and indifference. Discret. Appl. Math. 48(3), 261\u2013272 (1994)","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"10072_CR5","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0166-218X(85)90074-5","volume":"11","author":"D Gale","year":"1985","unstructured":"Gale, D., Sotomayor, M.A.O.: Some remarks on the stable matching problem. Discret. Appl. Math. 11(3), 223\u2013232 (1985)","journal-title":"Discret. Appl. Math."},{"issue":"6","key":"10072_CR6","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1086\/261272","volume":"92","author":"AE Roth","year":"1984","unstructured":"Roth, A.E.: The evolution of the labor market for medical interns and residents: A case study in game theory. J. Polit. Econ. 92(6), 991\u20131016 (1984)","journal-title":"J. Polit. Econ."},{"issue":"1","key":"10072_CR7","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/S0304-3975(01)00206-7","volume":"276","author":"DF Manlove","year":"2002","unstructured":"Manlove, D.F., Irving, R.W., Iwama, K., Miyazaki, S., Morita, Y.: Hard variants of stable marriage. Theor. Comput. Sci. 276(1), 261\u2013279 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"10072_CR8","unstructured":"Iwama, K., Miyazaki, S., Yamauchi, N.: A 1.875-approximation algorithm for the stable marriage problem. In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, pp 288\u2013297 (2007)"},{"issue":"1","key":"10072_CR9","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00453-009-9371-7","volume":"60","author":"Z Kir\u00e1ly","year":"2011","unstructured":"Kir\u00e1ly, Z.: Better and simpler approximation algorithms for the stable marriage problem. Algorithmica 60(1), 3\u201320 (2011)","journal-title":"Algorithmica"},{"key":"10072_CR10","doi-asserted-by":"crossref","unstructured":"McDermid, E.J.: A 3\/2-approximation algorithm for general stable marriage. In: Proceedings of the 36th International Colloquium on Automata, Languages and Programming, pp 689\u2013700 (2009)","DOI":"10.1007\/978-3-642-02927-1_57"},{"issue":"2","key":"10072_CR11","doi-asserted-by":"publisher","first-page":"189","DOI":"10.3390\/a7020189","volume":"7","author":"K Paluch","year":"2014","unstructured":"Paluch, K.: Faster and simpler approximation of stable matchings. Algorithms 7(2), 189\u2013202 (2014)","journal-title":"Algorithms"},{"issue":"3","key":"10072_CR12","doi-asserted-by":"publisher","first-page":"471","DOI":"10.3390\/a6030471","volume":"6","author":"Z Kir\u00e1ly","year":"2013","unstructured":"Kir\u00e1ly, Z.: Linear time local approximation algorithm for maximum stable marriage. Algorithms 6(3), 471\u2013484 (2013)","journal-title":"Algorithms"},{"key":"10072_CR13","doi-asserted-by":"crossref","unstructured":"Iwama, K., Manlove, D.F., Miyazaki, S., Morita, Y.: Stable marriage with incomplete lists and ties. In: Proceedings of the 26th International Colloquium on Automata, Languages, and Programming, pp 443\u2013452 (1999)","DOI":"10.1007\/3-540-48523-6_41"},{"issue":"1","key":"10072_CR14","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1016\/S0304-3975(03)00321-9","volume":"306","author":"MM Halld\u00f3rsson","year":"2003","unstructured":"Halld\u00f3rsson, M.M., Irving, R.W., Iwama, K., Manlove, D.F., Miyazaki, S., Morita, Y., Scott, S.: Approximability results for stable marriage problems with ties. Theor. Comput. Sci. 306(1), 431\u2013447 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"10072_CR15","unstructured":"Yanagisawa, H.: Approximation algorithms for stable marriage problems. Ph.D. Thesis, Graduate School of Informatics, Kyoto University (2007)"},{"issue":"3","key":"10072_CR16","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1007\/s00453-012-9699-2","volume":"68","author":"K Iwama","year":"2014","unstructured":"Iwama, K., Miyazaki, S., Yanagisawa, H.: A 25\/17-approximation algorithm for the stable marriage problem with one-sided ties. Algorithmica 68 (3), 758\u2013775 (2014)","journal-title":"Algorithmica"},{"key":"10072_CR17","unstructured":"Dean, B.C., Jalasutram, R.: Factor revealing LPs and stable matching with ties and incomplete lists. In: Proceedings of the 3rd International Workshop on Matching Under Preferences, pp 42\u201353 (2015)"},{"issue":"1","key":"10072_CR18","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s10107-015-0923-0","volume":"154","author":"C-C Huang","year":"2015","unstructured":"Huang, C-C, Kavitha, T.: Improved approximation algorithms for two variants of the stable marriage problem with ties. Math. Program. 154(1), 353\u2013380 (2015)","journal-title":"Math. Program."},{"key":"10072_CR19","unstructured":"Bauckholt, F., Pashkovich, K., Sanit\u00e0, L.: On the approximability of the stable marriage problem with one-sided ties. arXiv:1805.05391(2018)"},{"key":"10072_CR20","unstructured":"Radnai, A.: Approximation algorithms for the stable marriage problem. Master\u2019s Thesis, Department of Computer Science, E\u00f6tv\u00f6s Lor\u00e1nd University (2014)"},{"issue":"3","key":"10072_CR21","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1145\/1273340.1273346","volume":"3","author":"MM Halld\u00f3rsson","year":"2007","unstructured":"Halld\u00f3rsson, M.M., Iwama, K., Miyazaki, S., Yanagisawa, H.: Improved approximation results for the stable marriage problem. ACM Trans. Algorithm. 3(3), 30 (2007)","journal-title":"ACM Trans. Algorithm."},{"key":"10072_CR22","unstructured":"Huang, C-C, Iwama, K., Miyazaki, S., Yanagisawa, H.: A tight approximation bound for the stable marriage problem with restricted ties. In: Proceedings of the 18th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, pp 361\u2013380 (2015)"},{"issue":"3","key":"10072_CR23","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/j.tcs.2004.02.045","volume":"325","author":"MM Halld\u00f3rsson","year":"2004","unstructured":"Halld\u00f3rsson, M.M., Iwama, K., Miyazaki, S., Yanagisawa, H.: Randomized approximation of the stable marriage problem. Theor. Comput. Sci. 325 (3), 439\u2013465 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"10072_CR24","doi-asserted-by":"crossref","unstructured":"Chiang, R., Pashkovich, K.: On the approximability of the stable matching problem with ties of size two. arXiv:1808.04510 (2019)","DOI":"10.1007\/s00453-020-00703-9"},{"issue":"2","key":"10072_CR25","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.jda.2008.09.003","volume":"7","author":"RW Irving","year":"2009","unstructured":"Irving, R.W., Manlove, D.F., O\u2019Malley, G.: Stable marriage with ties and bounded length preference lists. J. Discret. Algorithm. 7(2), 213\u2013219 (2009)","journal-title":"J. Discret. Algorithm."},{"key":"10072_CR26","doi-asserted-by":"crossref","unstructured":"Abraham, D.J., Levavi, A., Manlove, D.F., O\u2019Malley, G.: The stable roommates problem with globally-ranked pairs. In: Proceedings of the 3rd International Workshop on Web and Internet Economics, pp 431\u2013444 (2007)","DOI":"10.1007\/978-3-540-77105-0_48"},{"issue":"15","key":"10072_CR27","doi-asserted-by":"publisher","first-page":"2959","DOI":"10.1016\/j.dam.2008.01.002","volume":"156","author":"RW Irving","year":"2008","unstructured":"Irving, R.W., Manlove, D.F., Scott, S.: The stable marriage problem with master preference lists. Discret. Appl. Math. 156(15), 2959\u20132977 (2008)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"10072_CR28","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/s00453-009-9326-z","volume":"58","author":"D Marx","year":"2010","unstructured":"Marx, D., Schlotter, I.: Parameterized complexity and local search approaches for the stable marriage problem with ties. Algorithmica 58(1), 170\u2013187 (2010)","journal-title":"Algorithmica"},{"key":"10072_CR29","unstructured":"Hamada, K., Miyazaki, S., Yanagisawa, H.: Strategy-proof approximation algorithms for the stable marriage problem with ties and incomplete lists. In: Proceedings of the 30th International Symposium on Algorithms and Computation, pp 9:1\u20139:14 (2019)"},{"issue":"6","key":"10072_CR30","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1145\/950620.950621","volume":"50","author":"K Jain","year":"2003","unstructured":"Jain, K., Mahdian, M., Markakis, E., Saberi, A., Vazirani, V.: Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. J. ACM 50(6), 795\u2013824 (2003)","journal-title":"J. ACM"},{"issue":"2","key":"10072_CR31","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1007\/s10107-014-0821-x","volume":"153","author":"CG Fernandes","year":"2015","unstructured":"Fernandes, C.G., Meira, L.A.A., Miyazawa, F.K., Pedrosa, L.L.C.: A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problems. Math. Program. 153(2), 655\u2013685 (2015)","journal-title":"Math. Program."},{"key":"10072_CR32","doi-asserted-by":"crossref","unstructured":"Mahdian, M., Yan, Q.: Online bipartite matching with random arrivals: An approach based on strongly factor-revealing LPs. In: Proceedings of the 43rd Annual ACM Symposium on Theory of Computing, pp 597\u2013606 (2011)","DOI":"10.1145\/1993636.1993716"},{"issue":"5","key":"10072_CR33","doi-asserted-by":"publisher","first-page":"22:1","DOI":"10.1145\/1284320.1284321","volume":"54","author":"A Mehta","year":"2007","unstructured":"Mehta, A., Saberi, A., Vazirani, U., Vazirani, V.: Adwords and generalized online matching. J. ACM 54(5), 22:1\u201322:19 (2007)","journal-title":"J. ACM"},{"issue":"1","key":"10072_CR34","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BF01586041","volume":"54","author":"UG Rothblum","year":"1992","unstructured":"Rothblum, U.G.: Characterization of stable matchings as extreme points of a polytope. Math. Program. 54(1), 57\u201367 (1992)","journal-title":"Math. Program."},{"issue":"3","key":"10072_CR35","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/0167-6377(89)90041-2","volume":"8","author":"JH Vande Vate","year":"1989","unstructured":"Vande Vate, J.H.: Linear programming brings marital bliss. Oper. Res. Lett. 8(3), 147\u2013153 (1989)","journal-title":"Oper. Res. Lett."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-022-10072-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00224-022-10072-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-022-10072-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,17]],"date-time":"2022-06-17T06:07:13Z","timestamp":1655446033000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00224-022-10072-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,19]]},"references-count":35,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["10072"],"URL":"https:\/\/doi.org\/10.1007\/s00224-022-10072-1","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,19]]},"assertion":[{"value":"25 January 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 May 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}