{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T14:01:12Z","timestamp":1709820072002},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,9,2]],"date-time":"2015-09-02T00:00:00Z","timestamp":1441152000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2016,11]]},"DOI":"10.1007\/s10878-015-9948-9","type":"journal-article","created":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T12:30:13Z","timestamp":1441110613000},"page":"1232-1253","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Serve or skip: the power of rejection in online bottleneck matching"],"prefix":"10.1007","volume":"32","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":[[2015,9,2]]},"reference":[{"issue":"1","key":"9948_CR1","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1007\/s10878-012-9581-9","volume":"27","author":"BM Anthony","year":"2014","unstructured":"Anthony BM, Chung C (2014) Online bottleneck matching. J Comb Optim 27(1):100\u2013114 (preliminary version appeared in COCOA, pp. 257\u2013268, 2012)","journal-title":"J Comb Optim"},{"key":"9948_CR2","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, pp 228\u2013239","DOI":"10.1007\/978-3-540-78773-0_20"},{"key":"9948_CR3","doi-asserted-by":"crossref","unstructured":"Devanur NR, Hayes TP (2009) The adwords problem: online keyword matching with budgeted bidders under random permutations. In: Proceedings of the 10th ACM conference on electronic commerce, EC \u201909, pp 71\u201378","DOI":"10.1145\/1566374.1566384"},{"key":"9948_CR4","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/j.tcs.2013.08.022","volume":"540\u2013541","author":"CG Fernandes","year":"2014","unstructured":"Fernandes CG, Schouery RCS (2014) Second-price ad auctions with binary bids and markets with good competition. Theor Comput Sci 540\u2013541:103\u2013114","journal-title":"Theor Comput Sci"},{"issue":"1\u20133","key":"9948_CR5","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/j.tcs.2004.10.028","volume":"332","author":"B Fuchs","year":"2005","unstructured":"Fuchs B, Hochst\u00e4ttler W, Kern W (2005) Online matching on a line. Theor Comput Sci 332(1\u20133):251\u2013264","journal-title":"Theor Comput Sci"},{"issue":"3","key":"9948_CR6","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1016\/0196-6774(88)90031-4","volume":"9","author":"HN Gabow","year":"1988","unstructured":"Gabow HN, Tarjan RE (1988) Algorithms for two bottleneck optimization problems. J Algorithm 9(3):411\u2013417","journal-title":"J Algorithm"},{"issue":"7","key":"9948_CR7","doi-asserted-by":"crossref","first-page":"1747","DOI":"10.1287\/opre.19.7.1747","volume":"19","author":"RS Garfinkel","year":"1971","unstructured":"Garfinkel RS (1971) An improved algorithm for the bottleneck assignment problem. Oper Res 19(7):1747\u20131751","journal-title":"Oper Res"},{"key":"9948_CR8","unstructured":"Goel G, Mehta A (2008) Online budgeted matching in random input models with applications to adwords. In: Proceedings of the nineteenth annual ACM-SIAM symposium on discrete algorithms, SODA \u201908, pp 982\u2013991"},{"key":"9948_CR9","unstructured":"Goldberg AV, Hartline JD, Wright A (2001) Competitive auctions and digital goods. In: Proceedings of the 12th annual ACM-SIAM symposium on discrete algorithms, SODA \u201901, pp 735\u2013744"},{"key":"9948_CR10","doi-asserted-by":"crossref","unstructured":"Gu A, Gupta A, Kumar A (2013) The power of deferral: maintaining a constant-competitive Steiner tree online. In: Proceedings of the 45th annual ACM symposium on theory of computing, pp 525\u2013534. ACM","DOI":"10.1145\/2488608.2488674"},{"key":"9948_CR11","doi-asserted-by":"crossref","unstructured":"Gupta A, Kumar A, Stein C (2014) Maintaining assignments online: Matching, scheduling, and flows. In: Proceedings of the 25th annual ACM-SIAM symposium on discrete algorithms, SODA 2014, pp 468\u2013479","DOI":"10.1137\/1.9781611973402.35"},{"key":"9948_CR12","doi-asserted-by":"crossref","unstructured":"Hartline JD, Roughgarden T (2009) Simple versus optimal mechanisms. In: ACM conference on electronic commerce, pp 225\u2013234","DOI":"10.1145\/1566374.1566407"},{"key":"9948_CR13","unstructured":"Idury R, Schaffer A (1992) A better lower bound for on-line bottleneck matching, manuscript. http:\/\/www.ncbi.nlm.nih.gov\/core\/assets\/cbb\/files\/Firehouse.pdf"},{"issue":"3","key":"9948_CR14","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. J Algorithm 14(3):478\u2013488 (preliminary version appeared in SODA, pp. 231\u2013240, 1991)","journal-title":"J Algorithm"},{"key":"9948_CR15","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1145\/347476.347479","volume":"47","author":"B Kalyanasundaram","year":"2000","unstructured":"Kalyanasundaram B, Pruhs K (2000a) Speed is as powerful as clairvoyance. J ACM 47:617\u2013643 (preliminary version appeared in FOCS, pp. 214\u2013221, 1995)","journal-title":"J ACM"},{"issue":"3","key":"9948_CR16","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1137\/S0895480198342310","volume":"13","author":"B Kalyanasundaram","year":"2000","unstructured":"Kalyanasundaram B, Pruhs K (2000b) The online transportation problem. SIAM J Discret Math 13(3):370\u2013383 (preliminary version appeared in ESA, pp 484\u2013493, 1995)","journal-title":"SIAM J Discret Math"},{"issue":"1","key":"9948_CR17","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/S0304-3975(99)00140-1","volume":"233","author":"B Kalyanasundaram","year":"2000","unstructured":"Kalyanasundaram B, Pruhs KR (2000c) An optimal deterministic algorithm for online b-matching. Theor Comput Sci 233(1):319\u2013325","journal-title":"Theor Comput Sci"},{"key":"9948_CR18","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 SG, Vazirani VV (1994) On-line algorithms for weighted bipartite matching and stable marriages. Theor Comput Sci 127:255\u2013267","journal-title":"Theor Comput Sci"},{"key":"9948_CR19","doi-asserted-by":"crossref","unstructured":"Megow N, Skutella M, Verschae J, Wiese A (2012) The power of recourse for online MST and TSP. In: Proceedings of automata, languages, and programming\u201439th international colloquium, ICALP 2012, Part I, pp 689\u2013700","DOI":"10.1007\/978-3-642-31594-7_58"},{"key":"9948_CR20","doi-asserted-by":"crossref","unstructured":"Mehta A, Saberi A, Vazirani U, Vazirani V (2007) Adwords and generalized online matching. J ACM 54(5):22:1\u201322:19","DOI":"10.1145\/1284320.1284321"},{"issue":"2","key":"9948_CR21","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/s00453-001-0068-9","volume":"32","author":"CA Phillips","year":"2002","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)","journal-title":"Algorithmica"},{"issue":"2","key":"9948_CR22","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T Roughgarden","year":"2002","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)","journal-title":"J ACM"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9948-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-015-9948-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9948-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9948-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,30]],"date-time":"2019-08-30T02:01:33Z","timestamp":1567130493000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-015-9948-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,2]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,11]]}},"alternative-id":["9948"],"URL":"https:\/\/doi.org\/10.1007\/s10878-015-9948-9","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,9,2]]}}}