{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T16:39:19Z","timestamp":1779295159942,"version":"3.51.4"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,9,3]],"date-time":"2020-09-03T00:00:00Z","timestamp":1599091200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,9,3]],"date-time":"2020-09-03T00:00:00Z","timestamp":1599091200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-15-CE40-0015"],"award-info":[{"award-number":["ANR-15-CE40-0015"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2020,11]]},"DOI":"10.1007\/s10878-020-00641-w","type":"journal-article","created":{"date-parts":[[2020,9,3]],"date-time":"2020-09-03T15:04:23Z","timestamp":1599145463000},"page":"974-1007","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Online maximum matching with recourse"],"prefix":"10.1007","volume":"40","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9819-9158","authenticated-orcid":false,"given":"Spyros","family":"Angelopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8103-5333","authenticated-orcid":false,"given":"Christoph","family":"D\u00fcrr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1218-9085","authenticated-orcid":false,"given":"Shendan","family":"Jin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,3]]},"reference":[{"issue":"3","key":"641_CR1","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.ipl.2012.09.011","volume":"113","author":"T Avitabile","year":"2013","unstructured":"Avitabile T, Mathieu C, Parkinson LH (2013) Online constrained optimization with recourse. Inf Process Lett 113(3):81\u201386","journal-title":"Inf Process Lett"},{"key":"641_CR2","doi-asserted-by":"crossref","unstructured":"Bernstein A, Holm J, Rotenberg E (2018) Online bipartite matching with amortized replacements. In: Proceedings of the 29th annual ACM-SIAM symposium on discrete algorithms, (SODA), pp 947\u2013959","DOI":"10.1137\/1.9781611975031.61"},{"key":"641_CR3","volume-title":"Online computation and competitive analysis","author":"A Borodin","year":"1998","unstructured":"Borodin A, El-Yaniv R (1998) Online computation and competitive analysis. Cambridge University Press, Cambridge"},{"key":"641_CR4","doi-asserted-by":"crossref","unstructured":"Boyar J, Favrholdt LM, Kotrb\u010d\u00edk M, Larsen KS (2017) Relaxing the irrevocability requirement for online graph algorithms. In: Proceedings of the 15th workshop on algorithms and data structures, (WADS), pp 217\u2013228","DOI":"10.1007\/978-3-319-62127-2_19"},{"key":"641_CR5","unstructured":"Buchbinder N, Segev D, Tkach Y (2017) Online algorithms for maximum cardinality matching with edge arrivals. In: Proceedings of the 25th annual European symposium on algorithms (ESA), pp 22:1\u201322:14"},{"key":"641_CR6","doi-asserted-by":"crossref","unstructured":"Chiplunkar A, Tirodkar S, Vishwanathan S (2015) On randomized algorithms for matching in the online preemptive model. In: Proceedings of the 23rd annual european symposium on algorithms (ESA), pp 325\u2013336","DOI":"10.1007\/978-3-662-48350-3_28"},{"key":"641_CR7","unstructured":"Epstein L, Levin A, Segev D, Weimann O (2013) Improved bounds for online preemptive matching. In: Proceedings of the 30th international symposium on theoretical aspects of computer science (STACS), pp 389\u2013399"},{"issue":"1","key":"641_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/140955276","volume":"45","author":"A Gu","year":"2016","unstructured":"Gu A, Gupta A, Kumar A (2016) The power of deferral: maintaining a constant-competitive steiner tree online. SIAM J Comput 45(1):1\u201328","journal-title":"SIAM J Comput"},{"key":"641_CR9","doi-asserted-by":"crossref","unstructured":"Gupta A, Kumar A (2014) Online Steiner tree with deletions. In: Proceedings of the 25th annual ACM-SIAM symposium on discrete algorithms, (SODA), Portland, Oregon, USA, pp 455\u2013467","DOI":"10.1137\/1.9781611973402.34"},{"key":"641_CR10","doi-asserted-by":"crossref","unstructured":"Gupta A, Kumar A, Stein C (2014) Maintaining assignments online: matching, scheduling, and flows. In: Proceedings of the 25th snnual ACM-SIAM symposium on discrete algorithms (SODA), pp 468\u2013479","DOI":"10.1137\/1.9781611973402.35"},{"key":"641_CR11","doi-asserted-by":"crossref","unstructured":"Han X, Makino K (2009) Online minimization knapsack problem. In: Proceedings of the 7th international workshop on approximation and online algorithms (WAOA), pp 182\u2013193","DOI":"10.1007\/978-3-642-12450-1_17"},{"key":"641_CR12","doi-asserted-by":"crossref","unstructured":"Iwama K, Taketomi S (2002) Removable online knapsack problems. In: Proceedings of the 29th international colloquium on automata, languages and programming (ICALP), pp 293\u2013305","DOI":"10.1007\/3-540-45465-9_26"},{"key":"641_CR13","doi-asserted-by":"crossref","unstructured":"Karp RM, Vazirani UV, Vazirani VV (1990) An optimal algorithm for on-line bipartite matching. In: Proceedings of the 22nd annual ACM symposium on theory of computing (STOC), pp 352\u2013358. ACM","DOI":"10.1145\/100216.100262"},{"issue":"427","key":"641_CR14","doi-asserted-by":"publisher","first-page":"55","DOI":"10.2307\/3615890","volume":"64","author":"E Love","year":"1980","unstructured":"Love E (1980) Some logarithmic inequalities. Math Gaz 64(427):55\u201357","journal-title":"Math Gaz"},{"key":"641_CR15","doi-asserted-by":"crossref","unstructured":"McGregor A (2005) Finding graph matchings in data streams. In: Approximation, randomization and combinatorial optimization, algorithms and techniques (APPROX-RANDOM), pp 170\u2013181","DOI":"10.1007\/11538462_15"},{"issue":"3","key":"641_CR16","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1137\/130917703","volume":"45","author":"N Megow","year":"2016","unstructured":"Megow N, Skutella M, Verschae J, Wiese A (2016) The power of recourse for online MST and TSP. SIAM J Comput 45(3):859\u2013880","journal-title":"SIAM J Comput"},{"issue":"4","key":"641_CR17","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1561\/0400000057","volume":"8","author":"A Mehta","year":"2013","unstructured":"Mehta A (2013) Online matching and ad allocation. Found Trends Theor Comput Sci 8(4):265\u2013368","journal-title":"Found Trends Theor Comput Sci"},{"key":"641_CR18","volume-title":"Topics in complex function theory: elliptic functions and uniformization theory","author":"C Siegel","year":"1988","unstructured":"Siegel C (1988) Topics in complex function theory: elliptic functions and uniformization theory, vol 1. Wiley, New York"},{"key":"641_CR19","doi-asserted-by":"crossref","unstructured":"Varadaraja AB (2011) Buyback problem-approximate matroid intersection with cancellation costs. In: Proceedings of the 38th international colloquium on automata, languages, and programming (ICALP), pp 379\u2013390","DOI":"10.1007\/978-3-642-22006-7_32"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00641-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-020-00641-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00641-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,3]],"date-time":"2021-09-03T21:01:12Z","timestamp":1630702872000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-020-00641-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,3]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["641"],"URL":"https:\/\/doi.org\/10.1007\/s10878-020-00641-w","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9,3]]},"assertion":[{"value":"3 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}