{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:03:02Z","timestamp":1761292982236},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,12,29]],"date-time":"2012-12-29T00:00:00Z","timestamp":1356739200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2014,1]]},"DOI":"10.1007\/s10878-012-9581-9","type":"journal-article","created":{"date-parts":[[2012,12,28]],"date-time":"2012-12-28T16:27:20Z","timestamp":1356712040000},"page":"100-114","source":"Crossref","is-referenced-by-count":16,"title":["Online bottleneck matching"],"prefix":"10.1007","volume":"27","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","published-online":{"date-parts":[[2012,12,29]]},"reference":[{"key":"9581_CR1","doi-asserted-by":"crossref","unstructured":"Chung C, Pruhs K, Uthaisombut P (2008) The online transportation problem: on the exponential boost of one extra server. In: LATIN 2008, pp 228\u2013239","DOI":"10.1007\/978-3-540-78773-0_20"},{"key":"9581_CR2","unstructured":"Hartline JD, Roughgarden T (2009) Simple versus optimal mechanisms. In: ACM conference on electronic commerce, pp 225\u2013234"},{"key":"9581_CR3","unstructured":"Idury R, Schaffer A (1992) A better lower bound for on-line bottleneck matching, manuscript"},{"key":"9581_CR4","doi-asserted-by":"crossref","unstructured":"Kalyanasundaram B, Pruhs K (1993) Online weighted matching. J Algorithms 14(3):478\u2013488. Preliminary version appeared in SODA, pp 231\u2013240, 1991","DOI":"10.1006\/jagm.1993.1026"},{"key":"9581_CR5","doi-asserted-by":"crossref","unstructured":"Kalyanasundaram B, Pruhs K (2000a) Speed is as powerful as clairvoyance. J ACM 47:617\u2013643. doi: 10.1145\/347476.347479 . http:\/\/dl.acm.org\/10.1145\/347476.347479 . ISSN 0004\u20135411. Preliminary version appeared in FOCS, 214\u2013221, 1995","DOI":"10.1145\/347476.347479"},{"key":"9581_CR6","doi-asserted-by":"crossref","unstructured":"Kalyanasundaram B, Pruhs K (2000b) The online transportation problem. SIAM J Discrete Math 13(3): 370\u2013383. Preliminary version appeared in ESA, pp 484\u2013493, 1995","DOI":"10.1137\/S0895480198342310"},{"key":"9581_CR7","doi-asserted-by":"crossref","unstructured":"Khuller S, Mitchell SG, Vazirani VV (1994) On-line algorithms for weighted bipartite matching and stable marriages. Theor Comput Sci 127:255\u2013267. doi: 10.1016\/0304-3975(94)90042-6 . http:\/\/dl.acm.org\/citation.cfm?id=179131.179134 . ISSN 0304\u20133975","DOI":"10.1016\/0304-3975(94)90042-6"},{"key":"9581_CR8","doi-asserted-by":"crossref","unstructured":"Phillips CA, Stein C, Torng E, Wein J (2002) Optimal time-critical scheduling via resource augmentation. Algorithmica 32(2):163\u2013200. Preliminary version appeared in STOC, pp 140\u2013149, 1997","DOI":"10.1007\/s00453-001-0068-9"},{"key":"9581_CR9","unstructured":"Roughgarden T, Tardos \u00c9 (2002) How bad is selfish routing? J ACM 49(2):236\u2013259. Preliminary version appeared in FOCS, pp 93\u2013102, 2000"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9581-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-012-9581-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9581-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,7]],"date-time":"2019-07-07T17:35:08Z","timestamp":1562520908000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-012-9581-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12,29]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,1]]}},"alternative-id":["9581"],"URL":"https:\/\/doi.org\/10.1007\/s10878-012-9581-9","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,12,29]]}}}