{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:10:32Z","timestamp":1725793832454},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319075563"},{"type":"electronic","value":"9783319075570"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07557-0_25","type":"book-chapter","created":{"date-parts":[[2014,5,17]],"date-time":"2014-05-17T11:50:30Z","timestamp":1400327430000},"page":"297-308","source":"Crossref","is-referenced-by-count":8,"title":["An Improved Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties"],"prefix":"10.1007","author":[{"given":"Chien-Chung","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Telikepalli","family":"Kavitha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","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.\u00a08037, pp. 85\u201396. Springer, Heidelberg (2013)"},{"key":"25_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. American Math. Monthly\u00a069, 9\u201315 (1962)","journal-title":"American Math. Monthly"},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0166-218X(85)90074-5","volume":"11","author":"D. Gale","year":"1985","unstructured":"Gale, D., Sotomayer, M.: Some remarks on the stable marriage problem. Discrete Applied Mathematics\u00a011, 223\u2013232 (1985)","journal-title":"Discrete Applied Mathematics"},{"key":"25_CR4","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":"3","key":"25_CR5","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/j.tcs.2004.02.045","volume":"325","author":"M.M. Halld\u00f3rsson","year":"2004","unstructured":"Halld\u00f3rsson, M.M., Iwama, K., Miyazaki, S., Yanagisawa, H.: Randomized approximation of the stable marriage problem. Theoretical Computer Science\u00a0325(3), 439\u2013465 (2004)","journal-title":"Theoretical Computer Science"},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0166-218X(92)00179-P","volume":"48","author":"R.W. Irving","year":"1994","unstructured":"Irving, R.W.: Stable marriage and indifference. Discrete Applied Mathematics\u00a048, 261\u2013272 (1994)","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"25_CR7","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s10878-007-9133-x","volume":"16","author":"R.W. Irving","year":"2008","unstructured":"Irving, R.W., Manlove, D.F.: Approximation algorithms for hard variants of the stable marriage and hospitals\/residents problems. Journal of Combinatorial Optimization\u00a016(3), 279\u2013292 (2008)","journal-title":"Journal of Combinatorial Optimization"},{"key":"25_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.F., 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":"25_CR9","unstructured":"Iwama, K., Miyazaki, S., Yamauchi, N.: A 1.875-approximation algorithm for the stable marriage problem. In: 18th SODA, pp. 288\u2013297 (2007)"},{"key":"25_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-642-15781-3_12","volume-title":"Algorithms \u2013 ESA 2010","author":"K. Iwama","year":"2010","unstructured":"Iwama, K., Miyazaki, S., Yanagisawa, H.: A 25\/17-approximation algorithm for the stable marriage problem with one-sided ties. In: de Berg, M., Meyer, U. (eds.) ESA 2010, Part II. LNCS, vol.\u00a06347, pp. 135\u2013146. Springer, Heidelberg (2010)"},{"issue":"1","key":"25_CR11","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00453-009-9371-7","volume":"60","author":"Z. Kir\u00e1ly","year":"2011","unstructured":"Kir\u00e1ly, Z.: Better and simpler approximation algorithms for the stable marriage problem. Algorithmica\u00a060(1), 3\u201320 (2011)","journal-title":"Algorithmica"},{"issue":"3","key":"25_CR12","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\u00a06(3), 471\u2013484 (2013)","journal-title":"Algorithms"},{"key":"25_CR13","unstructured":"Knuth, D.: Mariages stables et leurs relations avec d\u2019autre probl\u00e8mes. Les Presses de l\u2019universit\u00e9 de Montr\u00e9al (1976)"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Manlove, D.: Algorithmics of Matching Under Preferences. World Scientific Publishing Company Incorporated (2013)","DOI":"10.1142\/8591"},{"issue":"1-2","key":"25_CR15","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/S0304-3975(01)00206-7","volume":"276","author":"D.F. Manlove","year":"2002","unstructured":"Manlove, D.F., Irving, R.W., Iwama, K., Miyazaki, S., Morita, Y.: Hard variants of stable marriage. Theoretical Computer Science\u00a0276(1-2), 261\u2013279 (2002)","journal-title":"Theoretical Computer Science"},{"key":"25_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, Part I. LNCS, vol.\u00a05555, pp. 689\u2013700. Springer, Heidelberg (2009)"},{"key":"25_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/978-3-642-29116-6_15","volume-title":"Approximation and Online Algorithms","author":"K. Paluch","year":"2012","unstructured":"Paluch, K.: Faster and simpler approximation of stable matchings. In: Solis-Oba, R., Persiano, G. (eds.) WAOA 2011. LNCS, vol.\u00a07164, pp. 176\u2013187. Springer, Heidelberg (2012)"},{"key":"25_CR18","unstructured":"Roth, A., Sotomayor, M.: Two-sided matching: a study in game-theoretic modeling and analysis. Cambridge University Press (1992)"},{"key":"25_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/3-540-48777-8_32","volume-title":"Integer Programming and Combinatorial Optimization","author":"C.-P. Teo","year":"1999","unstructured":"Teo, C.-P., Sethuraman, J., Tan, W.P.: Gale-Shapley stable marriage problem revisited: strategic issues and applications. In: Cornu\u00e9jols, G., Burkard, R.E., Woeginger, G.J. (eds.) IPCO 1999. LNCS, vol.\u00a01610, pp. 429\u2013438. Springer, Heidelberg (1999)"},{"key":"25_CR20","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/0167-6377(89)90041-2","volume":"8","author":"J. Vande Vate","year":"1989","unstructured":"Vande Vate, J.: Linear Programming brings marital bliss. Operation Research Letters\u00a08, 147\u2013153 (1989)","journal-title":"Operation Research Letters"},{"key":"25_CR21","unstructured":"Yanagisawa, H.: Approximation algorithms for stable marriage problems. Ph.D. Thesis, Kyoto University (2007)"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07557-0_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T21:23:18Z","timestamp":1558905798000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07557-0_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319075563","9783319075570"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07557-0_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}