{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T16:50:33Z","timestamp":1744217433331},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2007,9,27]],"date-time":"2007-09-27T00:00:00Z","timestamp":1190851200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2008,12]]},"DOI":"10.1007\/s10951-007-0037-5","type":"journal-article","created":{"date-parts":[[2007,9,26]],"date-time":"2007-09-26T16:44:31Z","timestamp":1190825071000},"page":"449-455","source":"Crossref","is-referenced-by-count":6,"title":["A randomized algorithm for the on-line weighted bipartite matching problem"],"prefix":"10.1007","volume":"11","author":[{"given":"B\u00e9la","family":"Csaba","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e1s","family":"Pluh\u00e1r","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,9,27]]},"reference":[{"issue":"1","key":"37_CR1","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1137\/S0097539792224474","volume":"24","author":"N. Alon","year":"1995","unstructured":"Alon, N., Karp, R. M., Peleg, D., & West, D. (1995). A\u00a0graph\u2013theoretic game and its application to the k-server problem. SIAM Journal on Computing, 24(1), 78\u2013100.","journal-title":"SIAM Journal on Computing"},{"key":"37_CR2","doi-asserted-by":"crossref","unstructured":"Bartal, Y. (1996). Probabilistic approximations of metric spaces and its algorithmic applications. In IEEE symposium on foundations of computer science (pp.\u00a0184\u2013193).","DOI":"10.1109\/SFCS.1996.548477"},{"key":"37_CR3","doi-asserted-by":"crossref","unstructured":"Bartal, Y. (1998). On approximating arbitrary metrics by tree metrics. In STOC.","DOI":"10.1145\/276698.276725"},{"issue":"3","key":"37_CR4","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1016\/j.jcss.2004.04.011","volume":"69","author":"J. Fakcharoenphol","year":"2004","unstructured":"Fakcharoenphol, J., Rao, S., & Talwar, K. (2004). A\u00a0tight bound on approximating arbitrary metrics by tree metrics. Journal of Computer and System Sciences, 69(3), 485\u2013497.","journal-title":"Journal of Computer and System Sciences"},{"key":"37_CR5","volume-title":"Electronic notes in discrete mathematics","author":"B. Fuchs","year":"2003","unstructured":"Fuchs, B., Hochst\u00e4ttler, W., & Kern, W. (2003). Online matching on a line. In H. Broersma, U. Faigle, J. Hurink, S. Pickl, G. Woeginger (Eds.), Electronic notes in discrete mathematics (Vol. 13). Amsterdam: Elsevier."},{"issue":"3","key":"37_CR6","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1006\/jagm.1993.1026","volume":"14","author":"B. Kalyanasundaram","year":"1993","unstructured":"Kalyanasundaram, B., & Pruhs, K. (1993). Online weighted matching. Journal of Algorithms, 14(3), 478\u2013488.","journal-title":"Journal of Algorithms"},{"key":"37_CR7","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1007\/BFb0029573","volume-title":"Online algorithms: the state of the art","author":"B. Kalyanasundaram","year":"1998","unstructured":"Kalyanasundaram, B., & Pruhs, K. (1998). On-line network optimization problems. In A. Fiat & G. Woeginger (Eds.), Lecture notes in computer science : Vol.\u00a01442. Online algorithms: the state of the art (pp.\u00a0268\u2013280). Berlin: Springer."},{"key":"37_CR8","unstructured":"Karp, R. (1989). A 2 k -competitive algorithm for the circle. Manuscript, August 1989"},{"issue":"2","key":"37_CR9","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0304-3975(94)90042-6","volume":"127","author":"S. Khuller","year":"1994","unstructured":"Khuller, S., Mitchell, S. G., & Vazirani, V. V. (1994). On-line algorithms for weighted bipartite matching and stable marriages. Theoretical Computer Science, 127(2), 255\u2013267.","journal-title":"Theoretical Computer Science"},{"key":"37_CR10","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/978-3-540-24592-6_14","volume-title":"Approximation and online algorithms","author":"E. Koutsoupias","year":"2004","unstructured":"Koutsoupias, E., & Nanavati, A. (2004). The online matching problem on a line. In Lecture notes in computer science : Vol.\u00a02909. Approximation and online algorithms (pp.\u00a0179\u2013191). Berlin: Springer."},{"key":"37_CR11","doi-asserted-by":"crossref","unstructured":"Meyerson, A., Nanavati, A., & Poplawski, L. (2006). Randomized on-line algorithms for minimum metric bipartite matching. In SODA (pp.\u00a0954\u2013959).","DOI":"10.1145\/1109557.1109662"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-007-0037-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-007-0037-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-007-0037-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:40Z","timestamp":1559468380000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-007-0037-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9,27]]},"references-count":11,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2008,12]]}},"alternative-id":["37"],"URL":"https:\/\/doi.org\/10.1007\/s10951-007-0037-5","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,9,27]]}}}