{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:50:56Z","timestamp":1725490256525},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642317699"},{"type":"electronic","value":"9783642317705"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31770-5_23","type":"book-chapter","created":{"date-parts":[[2012,7,26]],"date-time":"2012-07-26T01:03:12Z","timestamp":1343264592000},"page":"257-268","source":"Crossref","is-referenced-by-count":0,"title":["Online Bottleneck Matching"],"prefix":"10.1007","author":[{"given":"Barbara M.","family":"Anthony","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christine","family":"Chung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-540-78773-0_20","volume-title":"LATIN 2008: Theoretical Informatics","author":"C. Chung","year":"2008","unstructured":"Chung, C., Pruhs, K., Uthaisombut, P.: The Online Transportation Problem: On the Exponential Boost of One Extra Server. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol.\u00a04957, pp. 228\u2013239. Springer, Heidelberg (2008)"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Hartline, J.D., Roughgarden, T.: Simple versus optimal mechanisms. In: ACM Conference on Electronic Commerce, pp. 225\u2013234 (2009)","DOI":"10.1145\/1566374.1566407"},{"key":"23_CR3","unstructured":"Idury, R., Schaffer, A.: A better lower bound for on-line bottleneck matching (1992) (manuscript)"},{"issue":"3","key":"23_CR4","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1006\/jagm.1993.1026","volume":"14","author":"B. Kalyanasundaram","year":"1993","unstructured":"Kalyanasundaram, B., Pruhs, K.: Online weighted matching. J. Algorithms\u00a014(3), 478\u2013488 (1993); Preliminary version appeared in SODA, pp. 231\u2013240 (1991)","journal-title":"J. Algorithms"},{"issue":"3","key":"23_CR5","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1137\/S0895480198342310","volume":"13","author":"B. Kalyanasundaram","year":"2000","unstructured":"Kalyanasundaram, B., Pruhs, K.: The online transportation problem. SIAM J. Discrete Math.\u00a013(3), 370\u2013383 (2000); Preliminary version appeared in ESA, pp. 484\u2013493 (1995)","journal-title":"SIAM J. Discrete Math."},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1145\/347476.347479","volume":"47","author":"B. Kalyanasundaram","year":"2000","unstructured":"Kalyanasundaram, B., Pruhs, K.: Speed is as powerful as clairvoyance. J. ACM\u00a047, 617\u2013643 (2000); Preliminary version appeared in FOCS, pp. 214\u2013221 (1995)","journal-title":"J. ACM"},{"key":"23_CR7","doi-asserted-by":"publisher","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.: On-line algorithms for weighted bipartite matching and stable marriages. Theor. Comput. Sci.\u00a0127, 255\u2013267 (1994)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"23_CR8","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s00453-001-0068-9","volume":"32","author":"C.A. Phillips","year":"2002","unstructured":"Phillips, C.A., Stein, C., Torng, E., Wein, J.: Optimal time-critical scheduling via resource augmentation. Algorithmica\u00a032(2), 163\u2013200 (2002); Preliminary version appeared in STOC, pp. 140\u2013149 (1997)","journal-title":"Algorithmica"},{"issue":"2","key":"23_CR9","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T. Roughgarden","year":"2002","unstructured":"Roughgarden, T., Tardos, \u00c9.: How bad is selfish routing? J. ACM\u00a049(2), 236\u2013259 (2002); Preliminary version appeared in STOC, pp. 140\u2013149 (1997); Preliminary version appeared in FOCS, pp. 93\u2013102 (2000)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31770-5_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:47:45Z","timestamp":1620114465000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31770-5_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642317699","9783642317705"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31770-5_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}