{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T07:13:57Z","timestamp":1761808437791,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2021,5,25]],"date-time":"2021-05-25T00:00:00Z","timestamp":1621900800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,5,25]],"date-time":"2021-05-25T00:00:00Z","timestamp":1621900800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2021,8]]},"DOI":"10.1007\/s00453-021-00834-7","type":"journal-article","created":{"date-parts":[[2021,5,25]],"date-time":"2021-05-25T12:03:10Z","timestamp":1621944190000},"page":"2374-2399","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Online Multistage Subset Maximization Problems"],"prefix":"10.1007","volume":"83","author":[{"given":"Evripidis","family":"Bampis","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6477-8706","authenticated-orcid":false,"given":"Bruno","family":"Escoffier","sequence":"additional","affiliation":[]},{"given":"Kevin","family":"Schewior","sequence":"additional","affiliation":[]},{"given":"Alexandre","family":"Teiller","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,25]]},"reference":[{"key":"834_CR1","doi-asserted-by":"crossref","unstructured":"Albers, S., Quedenfeld, J.: Optimal algorithms for right-sizing data centers. In: ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 363\u2013372 (2018)","DOI":"10.1145\/3210377.3210385"},{"issue":"2","key":"834_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2928272","volume":"13","author":"H An","year":"2017","unstructured":"An, H., Norouzi-Fard, A., Svensson, O.: Dynamic facility location via exponential clocks. ACM Trans. Algorithms 13(2), 1\u201320 (2017)","journal-title":"ACM Trans. Algorithms"},{"key":"834_CR3","doi-asserted-by":"crossref","unstructured":"Anthony, B.M., Gupta, A.: Infrastructure leasing problems. In: Conference on Integer Programming and Combinatorial Optimization (IPCO), pp. 424\u2013438 (2007)","DOI":"10.1007\/978-3-540-72792-7_32"},{"key":"834_CR4","doi-asserted-by":"crossref","unstructured":"Antoniadis, A., Schewior, K.: A tight lower bound for online convex optimization with switching costs. In: Workshop on Approximation and Online Algorithms (WAOA), pp. 164\u2013175 (2017)","DOI":"10.1007\/978-3-319-89441-6_13"},{"key":"834_CR5","unstructured":"Bampis, E., Escoffier, B., Lampis, M., Paschos, V.T.: Multistage matchings. In: Scandinavian Symposium and Workshops on Algorithm Theory (SWAT), pp. 1\u201313 (2018)"},{"key":"834_CR6","unstructured":"Bampis, E., Escoffier, B., Mladenovic, S.: Fair resource allocation over time. In: International Conference on Autonomous Agents and MultiAgent Systems (AAMAS), pp. 766\u2013773 (2018)"},{"key":"834_CR7","doi-asserted-by":"publisher","unstructured":"Bampis, E., Escoffier, B., Schewior, K., Teiller, A.: Online multistage subset maximization problems. In: M.A. Bender, O.\u00a0Svensson, G.\u00a0Herman (eds.) 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich\/Garching, Germany., LIPIcs, vol. 144, pp. 11:1\u201311:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2019.11","DOI":"10.4230\/LIPIcs.ESA.2019.11"},{"key":"834_CR8","unstructured":"Bansal, N., Gupta, A., Krishnaswamy, R., Pruhs, K., Schewior, K., Stein, C.: A 2-competitive algorithm for online convex optimization with switching costs. In: Workshop on Approximation, Randomization, and Combinatorial Optimization Algorithms and Techniques (APPROX\/RANDOM), pp. 96\u2013109 (2015)"},{"key":"834_CR9","doi-asserted-by":"crossref","unstructured":"Blanchard, N.K., Schabanel, N.: Dynamic sum-radii clustering. In: International Conference and Workshops on Algorithms and Computation (WALCOM), pp. 30\u201341 (2017)","DOI":"10.1007\/978-3-319-53925-6_3"},{"key":"834_CR10","doi-asserted-by":"crossref","unstructured":"Buchbinder, N., Chen, S., Naor, J.: Competitive analysis via regularization. In: ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 436\u2013444 (2014)","DOI":"10.1137\/1.9781611973402.32"},{"issue":"2","key":"834_CR11","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1287\/moor.2015.0742","volume":"41","author":"N Buchbinder","year":"2016","unstructured":"Buchbinder, N., Chen, S., Naor, J., Shamir, O.: Unified algorithms for online learning and competitive analysis. Math. Oper. Res. 41(2), 612\u2013625 (2016)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"834_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2963103","volume":"13","author":"E Cohen","year":"2016","unstructured":"Cohen, E., Cormode, G., Duffield, N.G., Lund, C.: On the tradeoff between stability and fit. ACM Trans. Algorithms 13(1), 1\u201324 (2016)","journal-title":"ACM Trans. Algorithms"},{"key":"834_CR13","doi-asserted-by":"crossref","unstructured":"Eisenstat, D., Mathieu, C., Schabanel, N.: Facility location in evolving metrics. In: International Colloquium on Automata, Languages, and Programming (ICALP), pp. 459\u2013470 (2014)","DOI":"10.1007\/978-3-662-43951-7_39"},{"issue":"1","key":"834_CR14","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.: The power of deferral: maintaining a constant-competitive steiner tree online. SIAM J. Comput. 45(1), 1\u201328 (2016)","journal-title":"SIAM J. Comput."},{"key":"834_CR15","doi-asserted-by":"crossref","unstructured":"Gupta, A., Talwar, K., Wieder, U.: Changing bases: Multistage optimization for matroids and matchings. In: International Colloquium on Automata, Languages, and Programming (ICALP), pp. 563\u2013575 (2014)","DOI":"10.1007\/978-3-662-43948-7_47"},{"key":"834_CR16","doi-asserted-by":"crossref","unstructured":"Joseph, V., de\u00a0Veciana, G.: Jointly optimizing multi-user rate adaptation for video transport over wireless systems: Mean-fairness-variability tradeoffs. In: IEEE International Conference on Computer Communications (INFOCOM), pp. 567\u2013575 (2012)","DOI":"10.1109\/INFCOM.2012.6195799"},{"issue":"5","key":"834_CR17","doi-asserted-by":"publisher","first-page":"1378","DOI":"10.1109\/TNET.2012.2226216","volume":"21","author":"M Lin","year":"2013","unstructured":"Lin, M., Wierman, A., Andrew, L.L.H., Thereska, E.: Dynamic right-sizing for power-proportional data centers. IEEE\/ACM Trans. Netw. 21(5), 1378\u20131391 (2013)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"834_CR18","doi-asserted-by":"crossref","unstructured":"Liu, Z., Liu, I., Low, S.H., Wierman, A.: Pricing data center demand response. In: ACM International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS), pp. 111\u2013123 (2014)","DOI":"10.1145\/2637364.2592004"},{"issue":"3","key":"834_CR19","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.: The power of recourse for online MST and TSP. SIAM J. Comput. 45(3), 859\u2013880 (2016)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"834_CR20","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/j.disopt.2013.10.001","volume":"10","author":"C Nagarajan","year":"2013","unstructured":"Nagarajan, C., Williamson, D.P.: Offline and online facility leasing. Discret. Optim. 10(4), 361\u2013370 (2013)","journal-title":"Discret. Optim."},{"key":"834_CR21","doi-asserted-by":"crossref","unstructured":"Olver, N., Pruhs, K., Sitters, R., Schewior, K., Stougie, L.: The itinerant list-update problem. In: Workshop on Approximation and Online Algorithms (WAOA), pp. 310\u2013326 (2018)","DOI":"10.1007\/978-3-030-04693-4_19"},{"issue":"2","key":"834_CR22","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.tcs.2007.03.006","volume":"382","author":"K Pruhs","year":"2007","unstructured":"Pruhs, K., Woeginger, G.J.: Approximation schemes for a class of subset selection problems. Theor. Comput. Sci. 382(2), 151\u2013156 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"834_CR23","unstructured":"Rottner, C.: Combinatorial aspects of the unit commitment problem. Ph.D. thesis, Sorbonne Universit\u00e9 (2018)"},{"issue":"2","key":"834_CR24","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"DD Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Commun. ACM 28(2), 202\u2013208 (1985)","journal-title":"Commun. ACM"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-021-00834-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-021-00834-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-021-00834-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,22]],"date-time":"2021-07-22T14:05:02Z","timestamp":1626962702000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-021-00834-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,25]]},"references-count":24,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2021,8]]}},"alternative-id":["834"],"URL":"https:\/\/doi.org\/10.1007\/s00453-021-00834-7","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2021,5,25]]},"assertion":[{"value":"25 October 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 May 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 May 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}