{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T10:10:10Z","timestamp":1746439810274,"version":"3.40.4"},"publisher-location":"Singapore","reference-count":18,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819644445","type":"print"},{"value":"9789819644452","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-96-4445-2_30","type":"book-chapter","created":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T09:33:56Z","timestamp":1746437636000},"page":"364-375","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Exact and\u00a0Approximate Heuristics for\u00a0the\u00a0Multi-modal Stable Matching with\u00a0Applications in\u00a0Industry Chains"],"prefix":"10.1007","author":[{"given":"Yang","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yicheng","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,6]]},"reference":[{"key":"30_CR1","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and approximation: combinatorial optimization problems and their approximability properties. Springer (2012)"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"Bredereck, R., Chen, J., Knop, D., Luo, J., Niedermeier, R.: Adapting stable matchings to evolving preferences. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol.\u00a034, pp. 1830\u20131837 (2020)","DOI":"10.1609\/aaai.v34i02.5550"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Chan, J.W.T., Chin, F.Y., Ye, D., Zhang, Y.: Online frequency allocation in cellular networks. In: Proceedings of the Nineteenth Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 241\u2013249 (2007)","DOI":"10.1145\/1248377.1248418"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"Chen, J., Niedermeier, R., Skowron, P.: Stable marriage with multi-modal preferences. In: Proceedings of the 2018 ACM Conference on Economics and Computation, EC 2018, pp. 269\u2013286 (2018)","DOI":"10.1145\/3219166.3219168"},{"issue":"4","key":"30_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3485000","volume":"9","author":"J Chen","year":"2021","unstructured":"Chen, J., Skowron, P., Sorge, M.: Matchings under preferences: strength of stability and tradeoffs. ACM Trans. Econ. Comput. 9(4), 1\u201355 (2021)","journal-title":"ACM Trans. Econ. Comput."},{"issue":"2","key":"30_CR6","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1137\/S089548010240415X","volume":"18","author":"U Feige","year":"2004","unstructured":"Feige, U.: Approximating maximum clique by removing subgraphs. SIAM J. Discret. Math. 18(2), 219\u2013225 (2004)","journal-title":"SIAM J. Discret. Math."},{"issue":"1","key":"30_CR7","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."},{"key":"30_CR8","unstructured":"Gusfield, D., Irving, R.W.: The stable marriage problem: structure and algorithms (1989)"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"Irving, R.W.: An efficient algorithm for the \u201cstable roommates\u201d problem. J. Algorithms 6(4), 577\u2013595 (1985)","DOI":"10.1016\/0196-6774(85)90033-1"},{"issue":"1","key":"30_CR10","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1006\/jagm.2002.1219","volume":"43","author":"RW Irving","year":"2002","unstructured":"Irving, R.W., Manlove, D.F.: The stable roommates problem with ties. J. Algorithms 43(1), 85\u2013105 (2002)","journal-title":"J. Algorithms"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"Iwama, K., Manlove, D., Miyazaki, S., Morita, Y.: Stable marriage with incomplete lists and ties. In: Automata, Languages and Programming: 26th International Colloquium, ICALP\u201999 Prague, pp. 443\u2013452 (2002)","DOI":"10.1007\/3-540-48523-6_41"},{"key":"30_CR12","unstructured":"Monge, A.E., Elkan, C., et\u00a0al.: The field matching problem: algorithms and applications. In: Kdd, vol.\u00a02, pp. 267\u2013270 (1996)"},{"issue":"3","key":"30_CR13","doi-asserted-by":"publisher","first-page":"897","DOI":"10.1257\/aer.98.3.897","volume":"98","author":"M Ostrovsky","year":"2008","unstructured":"Ostrovsky, M.: Stability in supply chain networks. Am. Econ. Rev. 98(3), 897\u2013923 (2008)","journal-title":"Am. Econ. Rev."},{"key":"30_CR14","doi-asserted-by":"crossref","unstructured":"Palmer, C., P\u00e1lv\u00f6lgyi, D.: At most 3.55 n stable matchings. In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), pp. 217\u2013227. IEEE (2022)","DOI":"10.1109\/FOCS52979.2021.00029"},{"issue":"5","key":"30_CR15","doi-asserted-by":"publisher","first-page":"888","DOI":"10.26599\/TST.2022.9010031","volume":"28","author":"J Tan","year":"2023","unstructured":"Tan, J., Sun, Y., Xu, Y., Zou, J.: Streaming algorithms for non-submodular maximization on the integer lattice. Tsinghua Sci. Technol. 28(5), 888\u2013895 (2023)","journal-title":"Tsinghua Sci. Technol."},{"key":"30_CR16","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1016\/j.jmsy.2021.09.013","volume":"61","author":"H Yang","year":"2021","unstructured":"Yang, H., Chen, R., Kumara, S.: Stable matching of customers and manufacturers for sharing economy of additive manufacturing. J. Manuf. Syst. 61, 288\u2013299 (2021)","journal-title":"J. Manuf. Syst."},{"issue":"5","key":"30_CR17","doi-asserted-by":"publisher","first-page":"916","DOI":"10.26599\/TST.2022.9010052","volume":"28","author":"W Yu","year":"2023","unstructured":"Yu, W., Liao, Y., Yang, Y.: Exact and approximation algorithms for the multi-depot capacitated arc routing problems. Tsinghua Sci. Technol. 28(5), 916\u2013928 (2023)","journal-title":"Tsinghua Sci. Technol."},{"key":"30_CR18","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Chen, J., Chin, F.Y., Han, X., Ting, H.F., Tsin, Y.H.: Improved online algorithms for 1-space bounded 2-dimensional bin packing. In: Algorithms and Computation: 21st International Symposium, ISAAC 2010, Jeju, Korea, 15\u201317 December 2010, Proceedings, Part II, vol. 21, pp. 242\u2013253. Springer (2010)","DOI":"10.1007\/978-3-642-17514-5_21"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-4445-2_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T09:34:03Z","timestamp":1746437643000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-4445-2_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819644445","9789819644452"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-4445-2_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"6 May 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2024","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":"cocoa2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.cocoa2024.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}