{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:28:27Z","timestamp":1743013707875,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030975456"},{"type":"electronic","value":"9783030975463"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-97546-3_40","type":"book-chapter","created":{"date-parts":[[2022,3,18]],"date-time":"2022-03-18T04:41:28Z","timestamp":1647578488000},"page":"494-506","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Heuristic Repair Algorithm for the Maximum Stable Marriage Problem with Ties and Incomplete Lists"],"prefix":"10.1007","author":[{"given":"Hoang Huu","family":"Viet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nguyen Thi","family":"Uyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Son Thanh","family":"Cao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"TaeChoong","family":"Chung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,19]]},"reference":[{"key":"40_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1007\/978-3-540-24587-2_49","volume-title":"Algorithms and Computation","author":"DJ Abraham","year":"2003","unstructured":"Abraham, D.J., Irving, R.W., Manlove, D.F.: The student-project allocation problem. In: Ibaraki, T., Katoh, N., Ono, H. (eds.) ISAAC 2003. LNCS, vol. 2906, pp. 474\u2013484. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-24587-2_49"},{"key":"40_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-642-40104-6_8","volume-title":"Algorithms and Data Structures","author":"G Askalidis","year":"2013","unstructured":"Askalidis, G., Immorlica, N., Kwanashie, A., Manlove, D.F., Pountourakis, E.: Socially stable matchings in the hospitals\/residents problem. In: Dehne, F., Solis-Oba, R., Sack, J.-R. (eds.) WADS 2013. LNCS, vol. 8037, pp. 85\u201396. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40104-6_8"},{"key":"40_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/3-540-45322-9_5","volume-title":"Stochastic Algorithms: Foundations and Applications","author":"P Codognet","year":"2001","unstructured":"Codognet, P., Diaz, D.: Yet another local search method for constraint solving. In: Steinh\u00f6fel, K. (ed.) SAGA 2001. LNCS, vol. 2264, pp. 73\u201390. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45322-9_5"},{"issue":"1","key":"40_CR4","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/s00224-017-9810-9","volume":"63","author":"\u00c1 Cseh","year":"2017","unstructured":"Cseh, \u00c1., Irving, R.W., Manlove, D.F.: The stable roommates problem with short lists. Theory Comput. Syst. 63(1), 128\u2013149 (2017). https:\/\/doi.org\/10.1007\/s00224-017-9810-9","journal-title":"Theory Comput. Syst."},{"issue":"1","key":"40_CR5","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.disopt.2016.03.002","volume":"20","author":"A Cseha","year":"2016","unstructured":"Cseha, A., Manlove, D.F.: Stable marriage and roommates problems with restricted edges: complexity and approximability. Discrete Optimizat. 20(1), 62\u201389 (2016)","journal-title":"Discrete Optimizat."},{"issue":"1","key":"40_CR6","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1016\/j.ejor.2016.12.011","volume":"260","author":"F Diebold","year":"2017","unstructured":"Diebold, F., Bichler, M.: Matching with indifferences: a comparison of algorithms in the context of course allocation. Eur. J. Oper. Res. 260(1), 268\u2013282 (2017)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"40_CR7","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1080\/00029890.1962.11989827","volume":"9","author":"D Gale","year":"1962","unstructured":"Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Am. Math. Mon. 9(1), 9\u201315 (1962)","journal-title":"Am. Math. Mon."},{"key":"40_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-642-15246-7_9","volume-title":"PRICAI 2010: Trends in Artificial Intelligence","author":"M Gelain","year":"2010","unstructured":"Gelain, M., Pini, M.S., Rossi, F., Venable, K.B., Walsh, T.: Local search for stable marriage problems with ties and incomplete lists. In: Zhang, B.-T., Orgun, M.A. (eds.) PRICAI 2010. LNCS (LNAI), vol. 6230, pp. 64\u201375. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15246-7_9"},{"issue":"4","key":"40_CR9","doi-asserted-by":"publisher","first-page":"591","DOI":"10.3390\/a6040591","volume":"6","author":"M Gelain","year":"2013","unstructured":"Gelain, M., Pini, M.S., Rossi, F., Venable, K.B., Walsh, T.: Local search approaches in stable matching problems. Algorithms 6(4), 591\u2013617 (2013)","journal-title":"Algorithms"},{"key":"40_CR10","unstructured":"Gent, I.P., Prosser, P.: An empirical study of the stable marriage problem with ties and incomplete lists. In: Proceedings of the 15th European Conference on Artificial Intelligence, pp. 141\u2013145. Lyon, France, July 2002"},{"key":"40_CR11","doi-asserted-by":"crossref","unstructured":"Irving, R.W., Manlove, D.F.: Finding large stable matchings. J. Experiment. Algorithmics 14(2), 1.2\u20131.2:30 (2009)","DOI":"10.1145\/1498698.1537595"},{"issue":"1","key":"40_CR12","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. Algorithms 7(1), 213\u2013219 (2009)","journal-title":"J. Discret. Algorithms"},{"key":"40_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/3-540-48523-6_41","volume-title":"Automata, Languages and Programming","author":"K Iwama","year":"1999","unstructured":"Iwama, K., Miyazaki, S., Morita, Y., Manlove, D.: Stable marriage with incomplete lists and ties. In: Wiedermann, J., van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 443\u2013452. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48523-6_41"},{"issue":"1","key":"40_CR14","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(1), 471\u2013484 (2013)","journal-title":"Algorithms"},{"issue":"1\u20132","key":"40_CR15","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. Theoret. Comput. Sci. 276(1\u20132), 261\u2013279 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"40_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1007\/978-3-642-02927-1_57","volume-title":"Automata, Languages and Programming","author":"E McDermid","year":"2009","unstructured":"McDermid, E.: A 3\/2-approximation algorithm for general stable marriage. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5555, pp. 689\u2013700. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02927-1_57"},{"key":"40_CR17","unstructured":"Munera, D., Diaz, D., Abreu, S., Rossi, F., Saraswat, V., Codognet, P.: A local search algorithm for SMTI and its extension to HRT problems. In: Proceedings of the 3rd International Workshop on Matching Under Preferences, pp. 66\u201377. Glasgow, United Kingdom, April 2015"},{"key":"40_CR18","doi-asserted-by":"crossref","unstructured":"Munera, D., Diaz, D., Abreu, S., Rossi, F., Saraswat, V., Codognet, P.: Solving hard stable matching problems via local search and cooperative parallelization. In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, pp. 1212\u20131218. Austin, Texas, January 2015","DOI":"10.1609\/aaai.v29i1.9360"},{"key":"40_CR19","doi-asserted-by":"crossref","unstructured":"Paluch, K.: Faster and simpler approximation of stable matchings. In: Proceedings of the 9th International Workshop on Approximation and Online Algorithms, pp. 176\u2013187. Saarbrucken, Germany, September 2011","DOI":"10.1007\/978-3-642-29116-6_15"},{"issue":"2","key":"40_CR20","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":"40_CR21","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/s10732-020-09464-8","volume":"27","author":"HH Viet","year":"2021","unstructured":"Viet, H.H., Uyen, N.T., Lee, S.G., Chung, T.C., Trang, L.H.: A max-conflicts based heuristic search for the stable marriage problem with ties and incomplete lists. J. Heuristics 27(3), 439\u2013458 (2021). https:\/\/doi.org\/10.1007\/s10732-020-09464-8","journal-title":"J. Heuristics"}],"container-title":["Lecture Notes in Computer Science","AI 2021: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-97546-3_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,29]],"date-time":"2023-01-29T12:15:34Z","timestamp":1674994534000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-97546-3_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030975456","9783030975463"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-97546-3_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"19 March 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australasian Joint Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sydney, NSW","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 February 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 February 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"34","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ausai2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ajcai2021.net","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"120","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"64","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"53% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was postponed to 2022 and held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}