{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T06:13:57Z","timestamp":1771049637031,"version":"3.50.1"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030835071","type":"print"},{"value":"9783030835088","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-83508-8_35","type":"book-chapter","created":{"date-parts":[[2021,7,30]],"date-time":"2021-07-30T13:05:06Z","timestamp":1627650306000},"page":"485-498","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Characterization of Super-Stable Matchings"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4074-0313","authenticated-orcid":false,"given":"Changyong","family":"Hu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5797-4389","authenticated-orcid":false,"given":"Vijay K.","family":"Garg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,31]]},"reference":[{"issue":"3","key":"35_CR1","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1215\/S0012-7094-37-00334-X","volume":"3","author":"G Birkhoff","year":"1937","unstructured":"Birkhoff, G., et al.: Rings of sets. Duke Math. J. 3(3), 443\u2013454 (1937)","journal-title":"Duke Math. J."},{"key":"35_CR2","unstructured":"Dean, B., 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\u20133","key":"35_CR3","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.tcs.2007.04.029","volume":"381","author":"T Fleiner","year":"2007","unstructured":"Fleiner, T., Irving, R.W., Manlove, D.F.: Efficient algorithms for generalized stable marriage and roommates problems. Theoret. Comput. Sci. 381(1\u20133), 162\u2013176 (2007)","journal-title":"Theoret. Comput. Sci."},{"key":"35_CR4","unstructured":"Gusfield, D., Irving, R.W.: The Stable marriage problem - structure and algorithms. Foundations of computing series. MIT Press (1989)"},{"key":"35_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-319-07557-0_25","volume-title":"Integer Programming and Combinatorial Optimization","author":"C-C Huang","year":"2014","unstructured":"Huang, C.-C., Kavitha, T.: An improved approximation algorithm for the stable marriage problem with one-sided ties. In: Lee, J., Vygen, J. (eds.) IPCO 2014. LNCS, vol. 8494, pp. 297\u2013308. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07557-0_25"},{"issue":"3","key":"35_CR6","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."},{"key":"35_CR7","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":"3","key":"35_CR8","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). https:\/\/doi.org\/10.1007\/s00453-012-9699-2","journal-title":"Algorithmica"},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"Kavitha, T., Mehlhorn, K., Michail, D., Paluch, K.E.: Strongly stable matchings in time o (nm) and extension to the hospitals-residents problem. ACM Trans. Algorithms (TALG) 3(2), 15-es (2007)","DOI":"10.1145\/1240233.1240238"},{"issue":"3","key":"35_CR10","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":"35_CR11","unstructured":"Kunysz, A.: An algorithm for the maximum weight strongly stable matching problem. In: 29th International Symposium on Algorithms and Computation (ISAAC 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018)"},{"key":"35_CR12","doi-asserted-by":"crossref","unstructured":"Kunysz, A., Paluch, K., Ghosal, P.: Characterisation of strongly stable matchings. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 107\u2013119. SIAM (2016)","DOI":"10.1137\/1.9781611974331.ch8"},{"key":"35_CR13","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 (2019)","DOI":"10.1137\/1.9781611975482.175"},{"issue":"1\u20133","key":"35_CR14","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0166-218X(01)00322-5","volume":"122","author":"DF Manlove","year":"2002","unstructured":"Manlove, D.F.: The structure of stable marriage with indifference. Discret. Appl. Math. 122(1\u20133), 167\u2013181 (2002)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"35_CR15","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0020-0190(96)00075-0","volume":"59","author":"A Marchetti-Spaccamela","year":"1996","unstructured":"Marchetti-Spaccamela, A., Nanni, U., Rohnert, H.: Maintaining a topological order under edge insertions. Inf. Process. Lett. 59(1), 53\u201358 (1996)","journal-title":"Inf. Process. Lett."},{"key":"35_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"},{"issue":"2","key":"35_CR17","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":"35_CR18","unstructured":"Pearce, D.J., Kelly, P.H.: Online algorithms for topological order and strongly connected components. Technical report, Citeseer (2003)"},{"key":"35_CR19","unstructured":"Pearce, D.J.: Some directed graph algorithms and their application to pointer analysis. Ph.D. thesis, University of London (2005)"},{"key":"35_CR20","unstructured":"Radnai, A.: Approximation algorithms for the stable matching problem. E\u00f6tv\u00f6s Lorand University (2014)"},{"issue":"1\u20133","key":"35_CR21","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\u20133), 57\u201367 (1992)","journal-title":"Math. Program."},{"key":"35_CR22","unstructured":"Scott, S.: A study of stable marriage problems with ties. Ph.D. thesis. University of Glasgow (2005)"},{"issue":"1","key":"35_CR23","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0166-218X(94)00080-W","volume":"58","author":"B Spieker","year":"1995","unstructured":"Spieker, B.: The set of super-stable marriages forms a distributive lattice. Discret. Appl. Math. 58(1), 79\u201384 (1995)","journal-title":"Discret. Appl. Math."},{"issue":"4","key":"35_CR24","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1287\/moor.23.4.874","volume":"23","author":"CP Teo","year":"1998","unstructured":"Teo, C.P., Sethuraman, J.: The geometry of fractional stable matchings and its applications. Math. Oper. Res. 23(4), 874\u2013891 (1998)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"35_CR25","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/0167-6377(89)90041-2","volume":"8","author":"JHV Vate","year":"1989","unstructured":"Vate, J.H.V.: Linear programming brings marital bliss. Oper. Res. Lett. 8(3), 147\u2013153 (1989)","journal-title":"Oper. Res. Lett."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-83508-8_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,18]],"date-time":"2022-02-18T11:28:33Z","timestamp":1645183713000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-83508-8_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030835071","9783030835088"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-83508-8_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"31 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Algorithms and Data Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 August 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/projects.cs.dal.ca\/wads2021\/","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":"123","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":"47","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":"38% - 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.1","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":"13","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)"}}]}}