{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:33Z","timestamp":1740109293118,"version":"3.37.3"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2020,3,30]],"date-time":"2020-03-30T00:00:00Z","timestamp":1585526400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,3,30]],"date-time":"2020-03-30T00:00:00Z","timestamp":1585526400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s00453-020-00703-9","type":"journal-article","created":{"date-parts":[[2020,3,30]],"date-time":"2020-03-30T15:03:31Z","timestamp":1585580611000},"page":"2668-2686","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On the Approximability of the Stable Matching Problem with Ties of Size Two"],"prefix":"10.1007","volume":"82","author":[{"given":"Robert","family":"Chiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kanstantsin","family":"Pashkovich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,3,30]]},"reference":[{"key":"703_CR1","unstructured":"Bauckholt, F., Pashkovich, K., Sanit\u00e0, L.: On the approximability of the stable marriage problem with one-sided ties. ArXiv e-prints (2018)"},{"issue":"1","key":"703_CR2","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. Am. Math. Mon. 69(1), 9\u201315 (1962)","journal-title":"Am. Math. Mon."},{"issue":"3","key":"703_CR3","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.: Some remarks on the stable matching problem. Discrete Appl. Math. 11(3), 223\u2013232 (1985)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"703_CR4","doi-asserted-by":"publisher","first-page":"30-es","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. Algorithms 3(3), 30-es (2007)","journal-title":"ACM Trans. Algorithms"},{"key":"703_CR5","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, 353\u2013380 (2015)","journal-title":"Math. Program."},{"key":"703_CR6","unstructured":"Iwama, K., Miyazaki, S., Yamauchi, N.: A 1.875-approximation algorithm for the stable marriage problem. In 18th Symposium on Discrete Algorithms (SODA), pp. 288\u2013287 (2007)"},{"key":"703_CR7","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, 758\u2013775 (2014)","journal-title":"Algorithmica"},{"issue":"1","key":"703_CR8","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"},{"issue":"3","key":"703_CR9","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":"703_CR10","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 Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 2823\u20132840. SIAM, Philadelphia (2019)","DOI":"10.1137\/1.9781611975482.175"},{"key":"703_CR11","doi-asserted-by":"crossref","unstructured":"Lam, C.-K., Plaxton, C.G.: Maximum stable matching with one-sided ties of bounded length. In: Algorithmic Game Theory, volume 11801 of Lecture Notes in Computer Science, pp. 343\u2013356. Springer, Cham (2019)","DOI":"10.1007\/978-3-030-30473-7_23"},{"issue":"1\u20132","key":"703_CR12","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\u20132), 261\u2013279 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"703_CR13","doi-asserted-by":"crossref","unstructured":"McDermid, E.: A 3\/2-approximation algorithm for general stable marriage. In: Automata, Languages and Programming, pp. 689\u2013700 (2009)","DOI":"10.1007\/978-3-642-02927-1_57"},{"issue":"2","key":"703_CR14","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"},{"key":"703_CR15","unstructured":"Yanagisawa, H.: Approximation Algorithms for Stable Marriage Problems. PhD thesis, Kyoto University (2007)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-020-00703-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-020-00703-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-020-00703-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,29]],"date-time":"2021-03-29T23:29:44Z","timestamp":1617060584000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-020-00703-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,30]]},"references-count":15,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["703"],"URL":"https:\/\/doi.org\/10.1007\/s00453-020-00703-9","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2020,3,30]]},"assertion":[{"value":"23 July 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 March 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 March 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}