{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:50:13Z","timestamp":1759063813762},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,4,22]],"date-time":"2009-04-22T00:00:00Z","timestamp":1240358400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2010,9]]},"DOI":"10.1007\/s00453-009-9307-2","type":"journal-article","created":{"date-parts":[[2009,4,21]],"date-time":"2009-04-21T17:11:32Z","timestamp":1240333892000},"page":"34-51","source":"Crossref","is-referenced-by-count":15,"title":["Understanding the Generalized Median Stable Matchings"],"prefix":"10.1007","volume":"58","author":[{"given":"Christine T.","family":"Cheng","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,4,22]]},"reference":[{"key":"9307_CR1","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1257\/000282805774670167","volume":"95","author":"A. Abdulkadiroglu","year":"2005","unstructured":"Abdulkadiroglu, A., Pathak, P., Roth, A.: The New York City high school match. Am. Econ. Rev., Pap. Proc. 95, 364\u2013367 (2005)","journal-title":"Am. Econ. Rev., Pap. Proc."},{"key":"9307_CR2","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1257\/000282805774669637","volume":"95","author":"A. Abdulkadiroglu","year":"2005","unstructured":"Abdulkadiroglu, A., Pathak, P., Roth, A., S\u00f6nmez, T.: The Boston public school match. Am. Econ. Rev., Pap. Proc. 95, 368\u2013371 (2005)","journal-title":"Am. Econ. Rev., Pap. Proc."},{"key":"9307_CR3","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0166-218X(84)90096-9","volume":"8","author":"H. Bandelt","year":"1984","unstructured":"Bandelt, H., Barthelemy, J.: Medians in median graphs. Discrete Appl. Math. 8, 131\u2013142 (1984)","journal-title":"Discrete Appl. Math."},{"key":"9307_CR4","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/j.tcs.2007.02.050","volume":"379","author":"V. Bansal","year":"2007","unstructured":"Bansal, V., Agrawal, A., Malhotra, V.: Polynomial time algorithm for an optimal stable assignment with multiple partners. Theor. Comput. Sci. 379, 317\u2013328 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"9307_CR5","first-page":"5","volume":"70","author":"M. Barbut","year":"1980","unstructured":"Barbut, M.: M\u00e9diane, distributivit\u00e9, \u00e9loignements, 1961. Math. Sci. Hum. 70, 5\u201331 (1980) (reprinted)","journal-title":"Math. Sci. Hum."},{"key":"9307_CR6","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1090\/S0002-9904-1947-08864-9","volume":"53","author":"G. Birkhoff","year":"1947","unstructured":"Birkhoff, G., Kiss, S.: A ternary operation in distributive lattices. Bull. Am. Math. Soc. 53, 749\u2013752 (1947)","journal-title":"Bull. Am. Math. Soc."},{"key":"9307_CR7","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/0097-3165(84)90056-6","volume":"37","author":"C. Blair","year":"1984","unstructured":"Blair, C.: Every finite distributive lattice is a set of stable matchings. J.\u00a0Comb. Theory\u00a0A 37, 353\u2013356 (1984)","journal-title":"J.\u00a0Comb. Theory\u00a0A"},{"key":"9307_CR8","doi-asserted-by":"crossref","unstructured":"Cheng, C.: The generalized median stable matchings: finding them is not that easy. In: Proceedings of the 8th Latin Theoretical Informatics Conference, pp.\u00a0568\u2013579 (2008)","DOI":"10.1007\/978-3-540-78773-0_49"},{"key":"9307_CR9","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/j.tcs.2008.02.014","volume":"400","author":"C. Cheng","year":"2008","unstructured":"Cheng, C., McDermid, E., Suzuki, I.: A unified approach to finding good stable matchings in the hospitals\/residents setting. Theor. Comput. Sci. 400, 84\u201399 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"9307_CR10","doi-asserted-by":"crossref","first-page":"1075","DOI":"10.1137\/0215077","volume":"15","author":"U. Faigle","year":"1986","unstructured":"Faigle, U., Lov\u00e1sz, L., Schrader, R., Tur\u00e1n, G.: Searching in trees, series-parallel and interval orders. SIAM J. Comput. 15, 1075\u20131084 (1986)","journal-title":"SIAM J. Comput."},{"key":"9307_CR11","series-title":"Memoirs of the American Mathematical Society","volume-title":"Stable Networks and Product Graphs","author":"T. Feder","year":"1995","unstructured":"Feder, T.: Stable Networks and Product Graphs. Memoirs of the American Mathematical Society, vol.\u00a0116. AMS, Providence (1995)"},{"key":"9307_CR12","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1287\/moor.28.1.103.14256","volume":"28","author":"T. Fleiner","year":"2003","unstructured":"Fleiner, T.: A fixed-point approach to stable matchings and some applications. Math. Oper. Res. 28, 103\u2013126 (2003)","journal-title":"Math. Oper. Res."},{"key":"9307_CR13","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1080\/00029890.1962.11989827","volume":"69","author":"D. Gale","year":"1962","unstructured":"Gale, D., Shapley, L.: College admissions and the stability of marriage. Am. Math. Mon. 69, 9\u201315 (1962)","journal-title":"Am. Math. Mon."},{"key":"9307_CR14","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1137\/0216010","volume":"16","author":"D. Gusfield","year":"1987","unstructured":"Gusfield, D.: Three fast algorithms for four problems in stable marriage. SIAM J. Comput. 16, 111\u2013128 (1987)","journal-title":"SIAM J. Comput."},{"key":"9307_CR15","volume-title":"The Stable Marriage Problem: Structure and Algorithms","author":"D. Gusfield","year":"1989","unstructured":"Gusfield, D., Irving, R.: The Stable Marriage Problem: Structure and Algorithms. The MIT Press, Cambridge (1989)"},{"key":"9307_CR16","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1137\/0215048","volume":"15","author":"R. Irving","year":"1986","unstructured":"Irving, R., Leather, P.: The complexity of counting stable marriages. SIAM J. Comput. 15, 655\u2013667 (1986)","journal-title":"SIAM J. Comput."},{"key":"9307_CR17","unstructured":"Kijima, S., Nemoto, T.: Randomized approximation for the generalize median stable matchings. A\u00a0preprint, RIMS-1648 (2008)"},{"key":"9307_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00182-006-0009-6","volume":"34","author":"B. Klaus","year":"2006","unstructured":"Klaus, B., Klijn, F.: Median stable matchings for college admissions. Int. J. Game Theory 34, 1\u201311 (2006)","journal-title":"Int. J. Game Theory"},{"key":"9307_CR19","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1137\/0403022","volume":"3","author":"B. LeClerc","year":"1990","unstructured":"LeClerc, B.: Medians and majorities in semimodular lattices. SIAM J. Discrete Math. 3, 266\u2013276 (1990)","journal-title":"SIAM J. Discrete Math."},{"key":"9307_CR20","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/978-94-009-2639-4_4","volume-title":"Algorithms and Order","author":"R. M\u00f6hring","year":"1989","unstructured":"M\u00f6hring, R.: Computationally tractable classes of ordered sets. In: Rival,\u00a0I. (ed.) Algorithms and Order, pp. 105\u2013193. Kluwer Academic, Dordrecht (1989)"},{"key":"9307_CR21","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/S0167-5060(08)70040-2","volume":"9","author":"B. Monjardet","year":"1980","unstructured":"Monjardet, B.: Th\u00e9orie et application de la m\u00e9diane dans les treillis distributifs finis. Ann. Discrete Math. 9, 87\u201391 (1980)","journal-title":"Ann. Discrete Math."},{"key":"9307_CR22","unstructured":"Nemoto, T.: Some remarks on the median stable marriage problem. In: Proceedings of the 17th International Symposium on Mathematical Programming (2000)"},{"key":"9307_CR23","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1137\/0212053","volume":"12","author":"J. Provan","year":"1983","unstructured":"Provan, J., Ball, M.: The complexity of counting cuts and of computing the probability that a graph is connected. SIAM J. Comput. 12, 777\u2013788 (1983)","journal-title":"SIAM J. Comput."},{"key":"9307_CR24","doi-asserted-by":"crossref","first-page":"748","DOI":"10.1257\/aer.89.4.748","volume":"89","author":"A. Roth","year":"1999","unstructured":"Roth, A., Peranson, E.: The redesign of the matching market of American physicians: Some engineering aspects of economic design. Am. Econ. Rev. 89, 748\u2013780 (1999)","journal-title":"Am. Econ. Rev."},{"key":"9307_CR25","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1287\/moor.9.2.248","volume":"9","author":"G. Steiner","year":"1984","unstructured":"Steiner, G.: Single machine scheduling with precedence constraints of dimension 2. Math. Oper. Res. 9, 248\u2013259 (1984)","journal-title":"Math. Oper. Res."},{"key":"9307_CR26","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0196-6774(87)90029-0","volume":"8","author":"G. Steiner","year":"1987","unstructured":"Steiner, G.: Searching in 2-dimensional partial orders. J.\u00a0Algorithms 8, 95\u2013105 (1987)","journal-title":"J.\u00a0Algorithms"},{"key":"9307_CR27","doi-asserted-by":"crossref","first-page":"874","DOI":"10.1287\/moor.23.4.874","volume":"23","author":"C.-P. Teo","year":"1998","unstructured":"Teo, C.-P., Sethuraman, J.: The geometry of fractional stable matchings and its applications. Math. Oper. Res. 23, 874\u2013891 (1998)","journal-title":"Math. Oper. Res."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-009-9307-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-009-9307-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-009-9307-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:45:04Z","timestamp":1559137504000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-009-9307-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,4,22]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,9]]}},"alternative-id":["9307"],"URL":"https:\/\/doi.org\/10.1007\/s00453-009-9307-2","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,4,22]]}}}