{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T00:32:10Z","timestamp":1775521930562,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642152450","type":"print"},{"value":"9783642152467","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15246-7_9","type":"book-chapter","created":{"date-parts":[[2010,8,23]],"date-time":"2010-08-23T22:28:27Z","timestamp":1282602507000},"page":"64-75","source":"Crossref","is-referenced-by-count":15,"title":["Local Search for Stable Marriage Problems with Ties and Incomplete Lists"],"prefix":"10.1007","author":[{"given":"Mirco","family":"Gelain","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria Silvia","family":"Pini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesca","family":"Rossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kristen Brent","family":"Venable","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toby","family":"Walsh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","volume-title":"The Stable Marriage Problem: Structure and Algorithms","author":"D. Gusfield","year":"1989","unstructured":"Gusfield, D., Irving, R.W.: The Stable Marriage Problem: Structure and Algorithms. MIT Press, Boston (1989)"},{"issue":"1","key":"9_CR2","doi-asserted-by":"publisher","first-page":"9","DOI":"10.2307\/2312726","volume":"69","author":"D. Gale","year":"1962","unstructured":"Gale, D., Shapley, L.S.: College admissions and the stability of marriage. The American Mathematical Monthly\u00a069(1), 9\u201315 (1962)","journal-title":"The American Mathematical Monthly"},{"issue":"1-2","key":"9_CR3","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/S0304-3975(01)00206-7","volume":"276","author":"D. Manlove","year":"2002","unstructured":"Manlove, D., Irving, R.W., Iwama, K., Miyazaki, S., Morita, Y.: Hard variants of stable marriage. Theor. Comput. Sci.\u00a0276(1-2), 261\u2013279 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR4","unstructured":"Gent, I.P., Prosser, P.: An empirical study of the stable marriage problem with ties and incomplete lists. In: ECAI, pp. 141\u2013145 (2002)"},{"key":"9_CR5","unstructured":"Gent, I.P., Prosser, P.: Sat encodings of the stable marriage problem with ties and incomplete lists. In: SAT 2002, pp. 133\u2013140 (2002)"},{"key":"9_CR6","unstructured":"Yanagisawa: Approximation algorithms for stable marriage problems. PhD thesis, Kyoto University, Graduate School of Informatics (2007)"},{"key":"9_CR7","series-title":"LNCS","first-page":"689","volume-title":"ICALP 2009","author":"E. McDermid","year":"2009","unstructured":"McDermid, E.: A 3\/2-approximation algorithm for general stable marriage. In: Albers, S., et al. (eds.) ICALP 2009, Part I. LNCS, vol.\u00a05555, pp. 689\u2013700. Springer, Heidelberg (2009)"},{"key":"9_CR8","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., Manlove, D., Miyazaki, S., Morita, Y.: Stable marriage with incomplete lists and ties. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol.\u00a01644, pp. 443\u2013452. Springer, Heidelberg (1999)"},{"key":"9_CR9","volume-title":"Handbook of Constraint Programming","author":"H. Holger","year":"2006","unstructured":"Holger, H., Hoos, E.T.: Local search methods. In: Rossi, F., Beek, P.V., Walsh, T. (eds.) Handbook of Constraint Programming. Elsevier, Amsterdam (2006)"},{"key":"9_CR10","unstructured":"Stutzle, T.G.: Local Search Algorithms for Combinatorial Problems - Analysis, Improvements, and New Applications. PhD thesis, Am Fachbereich Informatik der Technischen Universitat Darmstadt (1998)"},{"key":"9_CR11","unstructured":"Hoos, H.: On the run-time behaviour of stochastic local search algorithms for sat. In: Proc. AAAI 1999, pp. 661\u2013666 (1999)"},{"issue":"6","key":"9_CR12","doi-asserted-by":"publisher","first-page":"1475","DOI":"10.2307\/2938326","volume":"58","author":"A.E. Roth","year":"1990","unstructured":"Roth, A.E., Vate, J.H.V.: Random paths to stability in two-sided matching. Econometrica\u00a058(6), 1475\u20131480 (1990)","journal-title":"Econometrica"}],"container-title":["Lecture Notes in Computer Science","PRICAI 2010: Trends in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15246-7_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T22:03:51Z","timestamp":1606169031000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15246-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642152450","9783642152467"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15246-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}