{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:28:38Z","timestamp":1725474518345},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540681380"},{"type":"electronic","value":"9783540681410"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11944874_19","type":"book-chapter","created":{"date-parts":[[2006,11,27]],"date-time":"2006-11-27T18:41:09Z","timestamp":1164652869000},"page":"198-213","source":"Crossref","is-referenced-by-count":7,"title":["Assignment Problems in Rental Markets"],"prefix":"10.1007","author":[{"given":"David","family":"Abraham","sequence":"first","affiliation":[]},{"given":"Ning","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Vijay","family":"Kumar","sequence":"additional","affiliation":[]},{"given":"Vahab S.","family":"Mirrokni","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-540-30551-4_3","volume-title":"Algorithms and Computation","author":"D. Abraham","year":"2004","unstructured":"Abraham, D., Cechlarov, K., Manlove, D.F., Mehlhorn, K.: Pareto Optimality in House-Allocation Problems. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.\u00a03341, pp. 3\u201315. Springer, Heidelberg (2004)"},{"issue":"3","key":"19_CR2","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1287\/moor.23.3.640","volume":"10","author":"E.M. Arkin","year":"1998","unstructured":"Arkin, E.M., Hassin, R.: On Local Search for Weighted Packing Problems. Math. Oper. Res.\u00a010(3), 640\u2013648 (1998)","journal-title":"Math. Oper. Res."},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1002\/net.3230130404","volume":"13","author":"D. Avis","year":"1983","unstructured":"Avis, D.: A Survey of Heuristics for the Weighted Matching Problem. Networks\u00a013, 475\u2013493 (1983)","journal-title":"Networks"},{"issue":"5","key":"19_CR4","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.1137\/0218069","volume":"18","author":"H.N. Gabow","year":"1989","unstructured":"Gabow, H.N., Tarjan, R.E.: Faster Scaling Algorithms for Network Problems. SIAM Journal on Computing\u00a018(5), 1013\u20131036 (1989)","journal-title":"SIAM Journal on Computing"},{"key":"19_CR5","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 Mathematical Monthly\u00a069, 9\u201315 (1962)","journal-title":"American Mathematical Monthly"},{"key":"19_CR6","unstructured":"Goldberg, L., Paterson, M., Srinivasan, A., Sweedyk, E.: Better Approximation Guarantees for Job-Shop Scheduling. In: SODA 1997, pp. 599\u2013608 (1997)"},{"key":"19_CR7","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, Cambridge (1989)"},{"issue":"3","key":"19_CR8","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1137\/0210054","volume":"10","author":"Holyer","year":"1981","unstructured":"Holyer: The NP-Completeness of Some Edge Partitioning Problems. SIAM journal of Computing\u00a010(3), 713\u2013717 (1981)","journal-title":"SIAM journal of Computing"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"4","author":"J.E. Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp, R.M.: An n\n                        5\/ 2 Algorithm for Maximum Matching in Bipartite Graphs. SIAM J. Computing\u00a04, 225\u2013231 (1973)","journal-title":"SIAM J. Computing"},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/978-3-540-31856-9_53","volume-title":"STACS 2005","author":"N. Immorlica","year":"2005","unstructured":"Immorlica, N., Mahdian, M., Mirrokni, V.S.: Cycle Cover with Short Cycles. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol.\u00a03404, pp. 641\u2013653. Springer, Heidelberg (2005)"},{"key":"19_CR11","unstructured":"Irving, R.W., Kavitha, T., Mehlhorn, K., Michail, D., Paluch, K.: Rank-Maximal Matchings. In: SODA 2004, pp. 68\u201375 (2004)"},{"key":"19_CR12","unstructured":"Irving, R.W.: Greedy Matchings. Technical Report TR-2003-136, University of Glasgow (2003)"},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0020-0190(91)90246-E","volume":"37","author":"V. Kann","year":"1991","unstructured":"Kann, V.: Maximum Bounded 3-Dimensional Matching is MAX SNP-Complete. Inform. Process. Lett.\u00a037, 27\u201335 (1991)","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"19_CR14","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BF01215349","volume":"14","author":"F.T. Leighton","year":"1994","unstructured":"Leighton, F.T., Maggs, B.M., Rao, S.B.: Packet Routing and Job-Shop Scheduling in O(Congestion +Dilation) Steps. Combinatorica\u00a014(2), 167\u2013180 (1994)","journal-title":"Combinatorica"},{"key":"19_CR15","unstructured":"Mehlhorn, K., Michail, D.: Network Problems with Non-Polynomial Weights and Applications (manuscript, 2005)"},{"key":"19_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/3-540-49116-3_24","volume-title":"STACS 99","author":"R. Preis","year":"1999","unstructured":"Preis, R.: Linear Time 1\/2-Approximation Algorithm for Maximum Weighted Matching in General Graphs. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 259\u2013269. Springer, Heidelberg (1999)"},{"key":"19_CR17","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1137\/S009753979222676X","volume":"23","author":"D.B. Shmoys","year":"1994","unstructured":"Shmoys, D.B., Stein, C., Wein, J.: Improved Approximation Algorithms for Shop Scheduling Problems. SIAM Journal of Computing\u00a023, 617\u2013632 (1994)","journal-title":"SIAM Journal of Computing"},{"issue":"2","key":"19_CR18","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1287\/opre.45.2.288","volume":"45","author":"D. Williamson","year":"1997","unstructured":"Williamson, D., Hall, L., Hoogeveen, J., Hurkens, C., Lenstra, J., Sevastianov, S., Shmoys, D.: Short Shop Schedules. Operations Research\u00a045(2), 288\u2013294 (1997)","journal-title":"Operations Research"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11944874_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T17:08:55Z","timestamp":1558285735000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11944874_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540681380","9783540681410"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11944874_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}