Bansal, Nikhil; Spencer, Joel H. On-line balancing of random inputs. (English) Zbl 07290193 Random Struct. Algorithms 57, No. 4, 879-891 (2020). MSC: 91A68 68W27 PDF BibTeX XML Cite \textit{N. Bansal} and \textit{J. H. Spencer}, Random Struct. Algorithms 57, No. 4, 879--891 (2020; Zbl 07290193) Full Text: DOI
Bienkowski, Marcin; Böhm, Martin; Byrka, Jaroslaw; Chrobak, Marek; Dürr, Christoph; Folwarczný, Lukáš; Jeż, Łukasz; Sgall, Jiří; Thang, Nguyen Kim; Veselý, Pavel Online algorithms for multilevel aggregation. (English) Zbl 1445.90019 Oper. Res. 68, No. 1, 214-232 (2020). MSC: 90B22 68W27 PDF BibTeX XML Cite \textit{M. Bienkowski} et al., Oper. Res. 68, No. 1, 214--232 (2020; Zbl 1445.90019) Full Text: DOI
Li, Bo; Du, Qi; Zhang, Hai Online logistic regression. (Chinese. English summary) Zbl 07267500 Pure Appl. Math. 36, No. 1, 16-25 (2020). MSC: 68W27 68T05 PDF BibTeX XML Cite \textit{B. Li} et al., Pure Appl. Math. 36, No. 1, 16--25 (2020; Zbl 07267500) Full Text: DOI
Shen, Xiangkun; Nagarajan, Viswanath Online covering with \(\ell_q\)-norm objectives and applications to network design. (English) Zbl 07263691 Math. Program. 184, No. 1-2 (A), 155-182 (2020). MSC: 90C25 68W27 PDF BibTeX XML Cite \textit{X. Shen} and \textit{V. Nagarajan}, Math. Program. 184, No. 1--2 (A), 155--182 (2020; Zbl 07263691) Full Text: DOI
Gupta, Varun; Moseley, Benjamin; Uetz, Marc; Xie, Qiaomin Greed works – online algorithms for unrelated machine stochastic scheduling. (English) Zbl 1440.90012 Math. Oper. Res. 45, No. 2, 497-516 (2020). MSC: 90B36 68M20 68W27 90C27 90C59 PDF BibTeX XML Cite \textit{V. Gupta} et al., Math. Oper. Res. 45, No. 2, 497--516 (2020; Zbl 1440.90012) Full Text: DOI
Buchbinder, Niv; Feldman, Moran; Filmus, Yuval; Garg, Mohit Online submodular maximization: beating 1/2 made simple. (English) Zbl 07241651 Math. Program. 183, No. 1-2 (B), 149-169 (2020). MSC: 68W27 68W40 90B99 PDF BibTeX XML Cite \textit{N. Buchbinder} et al., Math. Program. 183, No. 1--2 (B), 149--169 (2020; Zbl 07241651) Full Text: DOI
Bampis, Evripidis; Megow, Nicole Correction to: approximation and online algorithms. (English) Zbl 07238571 Bampis, Evripidis (ed.) et al., Approximation and online algorithms. 17th international workshop, WAOA 2019, Munich, Germany, September 12–13, 2019. Revised selected papers. Cham: Springer (ISBN 978-3-030-39478-3/pbk; 978-3-030-39479-0/ebook). Lecture Notes in Computer Science 11926, C1 (2020). MSC: 68W25 68W27 PDF BibTeX XML Cite \textit{E. Bampis} and \textit{N. Megow}, Lect. Notes Comput. Sci. 11926, C1 (2020; Zbl 07238571) Full Text: DOI
Schmidt, Melanie; Schwiegelshohn, Chris; Sohler, Christian Fair coresets and streaming algorithms for fair \(k\)-means. (English) Zbl 07238570 Bampis, Evripidis (ed.) et al., Approximation and online algorithms. 17th international workshop, WAOA 2019, Munich, Germany, September 12–13, 2019. Revised selected papers. Cham: Springer (ISBN 978-3-030-39478-3/pbk; 978-3-030-39479-0/ebook). Lecture Notes in Computer Science 11926, 232-251 (2020). MSC: 68W25 68W27 PDF BibTeX XML Cite \textit{M. Schmidt} et al., Lect. Notes Comput. Sci. 11926, 232--251 (2020; Zbl 07238570) Full Text: DOI
Liu, Fu-Hong; Liu, Hsiang-Hsuan; Wong, Prudence W. H. Greedy is optimal for online restricted assignment and smart grid scheduling for unit size jobs. (English) Zbl 07238569 Bampis, Evripidis (ed.) et al., Approximation and online algorithms. 17th international workshop, WAOA 2019, Munich, Germany, September 12–13, 2019. Revised selected papers. Cham: Springer (ISBN 978-3-030-39478-3/pbk; 978-3-030-39479-0/ebook). Lecture Notes in Computer Science 11926, 217-231 (2020). MSC: 68W25 68W27 PDF BibTeX XML Cite \textit{F.-H. Liu} et al., Lect. Notes Comput. Sci. 11926, 217--231 (2020; Zbl 07238569) Full Text: DOI
Katsikarelis, Ioannis; Lampis, Michael; Paschos, Vangelis Th. Improved (In-)approximability bounds for \(d\)-scattered set. (English) Zbl 07238568 Bampis, Evripidis (ed.) et al., Approximation and online algorithms. 17th international workshop, WAOA 2019, Munich, Germany, September 12–13, 2019. Revised selected papers. Cham: Springer (ISBN 978-3-030-39478-3/pbk; 978-3-030-39479-0/ebook). Lecture Notes in Computer Science 11926, 202-216 (2020). MSC: 68W25 68W27 PDF BibTeX XML Cite \textit{I. Katsikarelis} et al., Lect. Notes Comput. Sci. 11926, 202--216 (2020; Zbl 07238568) Full Text: DOI
Inamdar, Tanmay; Varadarajan, Kasturi Fault tolerant clustering with outliers. (English) Zbl 07238567 Bampis, Evripidis (ed.) et al., Approximation and online algorithms. 17th international workshop, WAOA 2019, Munich, Germany, September 12–13, 2019. Revised selected papers. Cham: Springer (ISBN 978-3-030-39478-3/pbk; 978-3-030-39479-0/ebook). Lecture Notes in Computer Science 11926, 188-201 (2020). MSC: 68W25 68W27 PDF BibTeX XML Cite \textit{T. Inamdar} and \textit{K. Varadarajan}, Lect. Notes Comput. Sci. 11926, 188--201 (2020; Zbl 07238567) Full Text: DOI
Happach, Felix; Schulz, Andreas S. Precedence-constrained scheduling and min-sum set cover (extended Abstract). (English) Zbl 07238566 Bampis, Evripidis (ed.) et al., Approximation and online algorithms. 17th international workshop, WAOA 2019, Munich, Germany, September 12–13, 2019. Revised selected papers. Cham: Springer (ISBN 978-3-030-39478-3/pbk; 978-3-030-39479-0/ebook). Lecture Notes in Computer Science 11926, 170-187 (2020). MSC: 68W25 68W27 PDF BibTeX XML Cite \textit{F. Happach} and \textit{A. S. Schulz}, Lect. Notes Comput. Sci. 11926, 170--187 (2020; Zbl 07238566) Full Text: DOI
Grelier, Nicolas; De Joannis De Verclos, Rémi; Kang, Ross J.; Pirot, François Approximate strong edge-colouring of unit disk graphs. (English) Zbl 07238565 Bampis, Evripidis (ed.) et al., Approximation and online algorithms. 17th international workshop, WAOA 2019, Munich, Germany, September 12–13, 2019. Revised selected papers. Cham: Springer (ISBN 978-3-030-39478-3/pbk; 978-3-030-39479-0/ebook). Lecture Notes in Computer Science 11926, 154-169 (2020). MSC: 68W25 68W27 PDF BibTeX XML Cite \textit{N. Grelier} et al., Lect. Notes Comput. Sci. 11926, 154--169 (2020; Zbl 07238565) Full Text: DOI
Gálvez, Waldo; Grandoni, Fabrizio; Ameli, Afrouz Jabal; Sornat, Krzysztof On the Cycle Augmentation Problem: hardness and approximation algorithms. (English) Zbl 07238564 Bampis, Evripidis (ed.) et al., Approximation and online algorithms. 17th international workshop, WAOA 2019, Munich, Germany, September 12–13, 2019. Revised selected papers. Cham: Springer (ISBN 978-3-030-39478-3/pbk; 978-3-030-39479-0/ebook). Lecture Notes in Computer Science 11926, 138-153 (2020). MSC: 68W25 68W27 PDF BibTeX XML Cite \textit{W. Gálvez} et al., Lect. Notes Comput. Sci. 11926, 138--153 (2020; Zbl 07238564) Full Text: DOI
Feldkord, Björn; Knollmann, Till; Malatyali, Manuel; Meyer Auf Der Heide, Friedhelm Managing multiple mobile resources. (English) Zbl 07238563 Bampis, Evripidis (ed.) et al., Approximation and online algorithms. 17th international workshop, WAOA 2019, Munich, Germany, September 12–13, 2019. Revised selected papers. Cham: Springer (ISBN 978-3-030-39478-3/pbk; 978-3-030-39479-0/ebook). Lecture Notes in Computer Science 11926, 120-137 (2020). MSC: 68W25 68W27 PDF BibTeX XML Cite \textit{B. Feldkord} et al., Lect. Notes Comput. Sci. 11926, 120--137 (2020; Zbl 07238563) Full Text: DOI
Fekete, Sándor P.; Grosse-Holz, Jonas; Keldenich, Phillip; Schmidt, Arne Parallel online algorithms for the Bin Packing Problem. (English) Zbl 07238562 Bampis, Evripidis (ed.) et al., Approximation and online algorithms. 17th international workshop, WAOA 2019, Munich, Germany, September 12–13, 2019. Revised selected papers. Cham: Springer (ISBN 978-3-030-39478-3/pbk; 978-3-030-39479-0/ebook). Lecture Notes in Computer Science 11926, 106-119 (2020). MSC: 68W25 68W27 PDF BibTeX XML Cite \textit{S. P. Fekete} et al., Lect. Notes Comput. Sci. 11926, 106--119 (2020; Zbl 07238562) Full Text: DOI
Däubel, Karl An improved upper bound for the Ring Loading Problem. (English) Zbl 07238561 Bampis, Evripidis (ed.) et al., Approximation and online algorithms. 17th international workshop, WAOA 2019, Munich, Germany, September 12–13, 2019. Revised selected papers. Cham: Springer (ISBN 978-3-030-39478-3/pbk; 978-3-030-39479-0/ebook). Lecture Notes in Computer Science 11926, 89-105 (2020). MSC: 68W25 68W27 PDF BibTeX XML Cite \textit{K. Däubel}, Lect. Notes Comput. Sci. 11926, 89--105 (2020; Zbl 07238561) Full Text: DOI
Cormode, Graham; Veselý, Pavel Streaming algorithms for bin packing and vector scheduling. (English) Zbl 07238560 Bampis, Evripidis (ed.) et al., Approximation and online algorithms. 17th international workshop, WAOA 2019, Munich, Germany, September 12–13, 2019. Revised selected papers. Cham: Springer (ISBN 978-3-030-39478-3/pbk; 978-3-030-39479-0/ebook). Lecture Notes in Computer Science 11926, 72-88 (2020). MSC: 68W25 68W27 PDF BibTeX XML Cite \textit{G. Cormode} and \textit{P. Veselý}, Lect. Notes Comput. Sci. 11926, 72--88 (2020; Zbl 07238560) Full Text: DOI
Bougeret, Marin; Jansen, Klaus; Poss, Michael; Rohwedder, Lars Approximation results for makespan minimization with budgeted uncertainty. (English) Zbl 07238559 Bampis, Evripidis (ed.) et al., Approximation and online algorithms. 17th international workshop, WAOA 2019, Munich, Germany, September 12–13, 2019. Revised selected papers. Cham: Springer (ISBN 978-3-030-39478-3/pbk; 978-3-030-39479-0/ebook). Lecture Notes in Computer Science 11926, 60-71 (2020). MSC: 68W25 68W27 PDF BibTeX XML Cite \textit{M. Bougeret} et al., Lect. Notes Comput. Sci. 11926, 60--71 (2020; Zbl 07238559) Full Text: DOI
Berndt, Sebastian; Dreismann, Valentin; Grage, Kilian; Jansen, Klaus; Knof, Ingmar Robust online algorithms for certain dynamic packing problems. (English) Zbl 07238558 Bampis, Evripidis (ed.) et al., Approximation and online algorithms. 17th international workshop, WAOA 2019, Munich, Germany, September 12–13, 2019. Revised selected papers. Cham: Springer (ISBN 978-3-030-39478-3/pbk; 978-3-030-39479-0/ebook). Lecture Notes in Computer Science 11926, 43-59 (2020). MSC: 68W25 68W27 PDF BibTeX XML Cite \textit{S. Berndt} et al., Lect. Notes Comput. Sci. 11926, 43--59 (2020; Zbl 07238558) Full Text: DOI
Bergé, Pierre; Salaün, Lou Improved deterministic strategy for the Canadian Traveller Problem exploiting small max-\((s,t)\)-cuts. (English) Zbl 07238557 Bampis, Evripidis (ed.) et al., Approximation and online algorithms. 17th international workshop, WAOA 2019, Munich, Germany, September 12–13, 2019. Revised selected papers. Cham: Springer (ISBN 978-3-030-39478-3/pbk; 978-3-030-39479-0/ebook). Lecture Notes in Computer Science 11926, 29-42 (2020). MSC: 68W25 68W27 PDF BibTeX XML Cite \textit{P. Bergé} and \textit{L. Salaün}, Lect. Notes Comput. Sci. 11926, 29--42 (2020; Zbl 07238557) Full Text: DOI
Balogh, János; Békési, József; Dósa, György; Epstein, Leah; Levin, Asaf A new lower bound for classic online bin packing. (English) Zbl 07238556 Bampis, Evripidis (ed.) et al., Approximation and online algorithms. 17th international workshop, WAOA 2019, Munich, Germany, September 12–13, 2019. Revised selected papers. Cham: Springer (ISBN 978-3-030-39478-3/pbk; 978-3-030-39479-0/ebook). Lecture Notes in Computer Science 11926, 18-28 (2020). MSC: 68W25 68W27 PDF BibTeX XML Cite \textit{J. Balogh} et al., Lect. Notes Comput. Sci. 11926, 18--28 (2020; Zbl 07238556) Full Text: DOI
Ashur, Stav; Filtser, Omrit; Katz, Matthew J.; Saban, Rachel Terrain-like graphs: PTASs for guarding weakly-visible polygons and terrains. (English) Zbl 07238555 Bampis, Evripidis (ed.) et al., Approximation and online algorithms. 17th international workshop, WAOA 2019, Munich, Germany, September 12–13, 2019. Revised selected papers. Cham: Springer (ISBN 978-3-030-39478-3/pbk; 978-3-030-39479-0/ebook). Lecture Notes in Computer Science 11926, 1-17 (2020). MSC: 68W25 68W27 PDF BibTeX XML Cite \textit{S. Ashur} et al., Lect. Notes Comput. Sci. 11926, 1--17 (2020; Zbl 07238555) Full Text: DOI
Boyar, Joan; Ellen, Faith; Larsen, Kim S. Randomized distributed online algorithms against adaptive offline adversaries. (English) Zbl 1441.68294 Inf. Process. Lett. 161, Article ID 105973, 3 p. (2020). MSC: 68W27 68W15 68W20 PDF BibTeX XML Cite \textit{J. Boyar} et al., Inf. Process. Lett. 161, Article ID 105973, 3 p. (2020; Zbl 1441.68294) Full Text: DOI
Dütting, Paul; Feldman, Michal; Kesselheim, Thomas; Lucier, Brendan Prophet inequalities made easy: stochastic optimization by pricing nonstochastic inputs. (English) Zbl 07226862 SIAM J. Comput. 49, No. 3, 540-582 (2020). MSC: 91B24 60G40 93E20 68W27 PDF BibTeX XML Cite \textit{P. Dütting} et al., SIAM J. Comput. 49, No. 3, 540--582 (2020; Zbl 07226862) Full Text: DOI
Birx, Alexander; Disser, Yann Tight analysis of the Smartstart algorithm for online dial-a-ride on the line. (English) Zbl 07225943 SIAM J. Discrete Math. 34, No. 2, 1409-1443 (2020). MSC: 68W27 90C27 PDF BibTeX XML Cite \textit{A. Birx} and \textit{Y. Disser}, SIAM J. Discrete Math. 34, No. 2, 1409--1443 (2020; Zbl 07225943) Full Text: DOI
Csirik, J.; Dósa, Gy.; Kószó, D. Online scheduling with machine cost and a quadratic objective function. (English) Zbl 1440.68338 Chatzigeorgiou, Alexander (ed.) et al., SOFSEM 2020: theory and practice of computer science. 46th international conference on current trends in theory and practice of informatics, SOFSEM 2020, Limassol, Cyprus, January 20–24, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12011, 199-210 (2020). MSC: 68W27 68W40 90B35 PDF BibTeX XML Cite \textit{J. Csirik} et al., Lect. Notes Comput. Sci. 12011, 199--210 (2020; Zbl 1440.68338) Full Text: DOI
Wu, Xue-Yan; Fan, Zhi-Ping; Cao, Bing-Bing Cost-sharing strategy for carbon emission reduction and sales effort: a Nash game with government subsidy. (English) Zbl 1449.90051 J. Ind. Manag. Optim. 16, No. 4, 1999-2027 (2020). MSC: 90B06 68W27 68W40 91A10 91B76 PDF BibTeX XML Cite \textit{X.-Y. Wu} et al., J. Ind. Manag. Optim. 16, No. 4, 1999--2027 (2020; Zbl 1449.90051) Full Text: DOI
Li, Junlin; Li, Xiuting Online sparse identification for regression models. (English) Zbl 1447.93360 Syst. Control Lett. 141, Article ID 104710, 8 p. (2020). MSC: 93E12 68W27 PDF BibTeX XML Cite \textit{J. Li} and \textit{X. Li}, Syst. Control Lett. 141, Article ID 104710, 8 p. (2020; Zbl 1447.93360) Full Text: DOI
Balogh, János; Békési, József; Dósa, György; Epstein, Leah; Levin, Asaf Online bin packing with cardinality constraints resolved. (English) Zbl 1442.68269 J. Comput. Syst. Sci. 112, 34-49 (2020). MSC: 68W27 68Q17 90C27 PDF BibTeX XML Cite \textit{J. Balogh} et al., J. Comput. Syst. Sci. 112, 34--49 (2020; Zbl 1442.68269) Full Text: DOI
Tian, Ji; Zhou, Yan; Fu, Ruyan An improved semi-online algorithm for scheduling on a single machine with unexpected breakdown. (English) Zbl 1445.90039 J. Comb. Optim. 40, No. 1, 170-180 (2020). MSC: 90B35 68W27 PDF BibTeX XML Cite \textit{J. Tian} et al., J. Comb. Optim. 40, No. 1, 170--180 (2020; Zbl 1445.90039) Full Text: DOI
Borodin, Allan; Boyar, Joan; Larsen, Kim S.; Pankratov, Denis Advice complexity of priority algorithms. (English) Zbl 1444.68299 Theory Comput. Syst. 64, No. 4, 593-625 (2020). MSC: 68W27 68Q17 90C59 PDF BibTeX XML Cite \textit{A. Borodin} et al., Theory Comput. Syst. 64, No. 4, 593--625 (2020; Zbl 1444.68299) Full Text: DOI
Azar, Yossi; Jacob Fanani, Amit Deterministic min-cost matching with delays. (English) Zbl 1444.68297 Theory Comput. Syst. 64, No. 4, 572-592 (2020). MSC: 68W27 68R10 68W40 PDF BibTeX XML Cite \textit{Y. Azar} and \textit{A. Jacob Fanani}, Theory Comput. Syst. 64, No. 4, 572--592 (2020; Zbl 1444.68297) Full Text: DOI
Angelopoulos, Spyros; Lidbetter, Thomas Competitive search in a network. (English) Zbl 1443.91069 Eur. J. Oper. Res. 286, No. 2, 781-790 (2020). MSC: 91A43 68P10 68W27 68T20 90B40 PDF BibTeX XML Cite \textit{S. Angelopoulos} and \textit{T. Lidbetter}, Eur. J. Oper. Res. 286, No. 2, 781--790 (2020; Zbl 1443.91069) Full Text: DOI
López-Ortiz, Alejandro; Renault, Marc P.; Rosén, Adi Paid exchanges are worth the price. (English) Zbl 1434.68131 Theor. Comput. Sci. 824-825, 1-10 (2020). MSC: 68P05 68W27 PDF BibTeX XML Cite \textit{A. López-Ortiz} et al., Theor. Comput. Sci. 824--825, 1--10 (2020; Zbl 1434.68131) Full Text: DOI
Chen, Ru-Bing; Lu, Ling-Fa; Yuan, Jin-Jiang; Zhang, Li-Qi Improved approximation algorithm for scheduling on a serial batch machine with split-allowed delivery. (English) Zbl 1449.90097 J. Oper. Res. Soc. China 8, No. 1, 133-143 (2020). MSC: 90B35 68W27 PDF BibTeX XML Cite \textit{R.-B. Chen} et al., J. Oper. Res. Soc. China 8, No. 1, 133--143 (2020; Zbl 1449.90097) Full Text: DOI
Disser, Yann; Fearnley, John; Gairing, Martin; Göbel, Oliver; Klimm, Max; Schmand, Daniel; Skopalik, Alexander; Tönnis, Andreas Hiring secretaries over time: the benefit of concurrent employment. (English) Zbl 1444.60032 Math. Oper. Res. 45, No. 1, 323-352 (2020). MSC: 60G40 62L15 68W27 68W40 PDF BibTeX XML Cite \textit{Y. Disser} et al., Math. Oper. Res. 45, No. 1, 323--352 (2020; Zbl 1444.60032) Full Text: DOI
Akaria, Islam; Epstein, Leah An optimal online algorithm for scheduling with general machine cost functions. (English) Zbl 1436.90042 J. Sched. 23, No. 2, 155-162 (2020). MSC: 90B35 68W27 PDF BibTeX XML Cite \textit{I. Akaria} and \textit{L. Epstein}, J. Sched. 23, No. 2, 155--162 (2020; Zbl 1436.90042) Full Text: DOI
Xu, Cuixia; Zhu, Junlong; Shang, Youlin; Wu, Qingtao A distributed conjugate gradient online learning method over networks. (English) Zbl 1435.90110 Complexity 2020, Article ID 1390963, 13 p. (2020). MSC: 90C25 90C52 68T05 68W27 68M14 PDF BibTeX XML Cite \textit{C. Xu} et al., Complexity 2020, Article ID 1390963, 13 p. (2020; Zbl 1435.90110) Full Text: DOI
Bansal, Nikhil; Böhm, Martin; Eliáš, Marek; Koumoutsos, Grigorios; Umboh, Seeun William Nested convex bodies are chaseable. (English) Zbl 1433.68618 Algorithmica 82, No. 6, 1640-1653 (2020). MSC: 68W27 68U05 PDF BibTeX XML Cite \textit{N. Bansal} et al., Algorithmica 82, No. 6, 1640--1653 (2020; Zbl 1433.68618) Full Text: DOI
Takagi, Takuya; Inenaga, Shunsuke; Arimura, Hiroki; Breslauer, Dany; Hendrian, Diptarama Fully-online suffix tree and directed acyclic word graph construction for multiple texts. (English) Zbl 1432.68611 Algorithmica 82, No. 5, 1346-1377 (2020). MSC: 68W32 68P05 68W27 68W40 PDF BibTeX XML Cite \textit{T. Takagi} et al., Algorithmica 82, No. 5, 1346--1377 (2020; Zbl 1432.68611) Full Text: DOI
Angelopoulos, Spyros; Renault, Marc P.; Schweitzer, Pascal Stochastic dominance and the bijective ratio of online algorithms. (English) Zbl 1432.68586 Algorithmica 82, No. 5, 1101-1135 (2020). MSC: 68W27 90C27 PDF BibTeX XML Cite \textit{S. Angelopoulos} et al., Algorithmica 82, No. 5, 1101--1135 (2020; Zbl 1432.68586) Full Text: DOI
Lan, Guanghui First-order and stochastic optimization methods for machine learning. (English) Zbl 1442.68003 Springer Series in the Data Sciences. Cham: Springer (ISBN 978-3-030-39567-4/hbk; 978-3-030-39568-1/ebook). xiii, 582 p. (2020). MSC: 68-02 68T05 68W15 68W20 68W27 90C15 90C25 90C26 PDF BibTeX XML Cite \textit{G. Lan}, First-order and stochastic optimization methods for machine learning. Cham: Springer (2020; Zbl 1442.68003) Full Text: DOI
Gelles, Ran; Ostrovsky, Rafail; Roytman, Alan Efficient error-correcting codes for sliding windows. (English) Zbl 07182604 SIAM J. Discrete Math. 34, No. 1, 904-937 (2020). MSC: 94B 68W27 PDF BibTeX XML Cite \textit{R. Gelles} et al., SIAM J. Discrete Math. 34, No. 1, 904--937 (2020; Zbl 07182604) Full Text: DOI
Radoszewski, Jakub; Starikovskaya, Tatiana Streaming \(k\)-mismatch with error correcting and applications. (English) Zbl 1435.68402 Inf. Comput. 271, Article ID 104513, 16 p. (2020). MSC: 68W32 68W27 PDF BibTeX XML Cite \textit{J. Radoszewski} and \textit{T. Starikovskaya}, Inf. Comput. 271, Article ID 104513, 16 p. (2020; Zbl 1435.68402) Full Text: DOI
Wang, Cheng; Hu, Ting Online regularized pairwise learning with least squares loss. (English) Zbl 1435.68284 Anal. Appl., Singap. 18, No. 1, 49-78 (2020). MSC: 68T05 47B32 62J02 68W27 PDF BibTeX XML Cite \textit{C. Wang} and \textit{T. Hu}, Anal. Appl., Singap. 18, No. 1, 49--78 (2020; Zbl 1435.68284) Full Text: DOI
Cano, Alberto; Krawczyk, Bartosz Kappa updated ensemble for drifting data stream mining. (English) Zbl 1440.68203 Mach. Learn. 109, No. 1, 175-218 (2020). MSC: 68T05 62H30 68W27 PDF BibTeX XML Cite \textit{A. Cano} and \textit{B. Krawczyk}, Mach. Learn. 109, No. 1, 175--218 (2020; Zbl 1440.68203) Full Text: DOI
Huang, Chien-Chung; Kakimura, Naonori; Yoshida, Yuichi Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint. (English) Zbl 1435.68389 Algorithmica 82, No. 4, 1006-1032 (2020). MSC: 68W27 68W25 90C27 PDF BibTeX XML Cite \textit{C.-C. Huang} et al., Algorithmica 82, No. 4, 1006--1032 (2020; Zbl 1435.68389) Full Text: DOI
Chrobak, Marek; Dürr, Christoph; Fabijan, Aleksander; Nilsson, Bengt J. Online clique clustering. (English) Zbl 1435.68386 Algorithmica 82, No. 4, 938-965 (2020). MSC: 68W27 05C69 05C70 05C85 90C35 PDF BibTeX XML Cite \textit{M. Chrobak} et al., Algorithmica 82, No. 4, 938--965 (2020; Zbl 1435.68386) Full Text: DOI
Zhang, Yubai; Zhang, Zhao; Shi, Yishuo; Li, Xianyue Algorithm for online 3-path vertex cover. (English) Zbl 1434.68696 Theory Comput. Syst. 64, No. 2, 327-338 (2020). MSC: 68W27 05C70 05C85 68R10 PDF BibTeX XML Cite \textit{Y. Zhang} et al., Theory Comput. Syst. 64, No. 2, 327--338 (2020; Zbl 1434.68696) Full Text: DOI
Ergün, Funda; Grigorescu, Elena; Sadeqi Azer, Erfan; Zhou, Samson Periodicity in data streams with wildcards. (English) Zbl 1434.68691 Theory Comput. Syst. 64, No. 1, 177-197 (2020). MSC: 68W27 68W20 68W32 PDF BibTeX XML Cite \textit{F. Ergün} et al., Theory Comput. Syst. 64, No. 1, 177--197 (2020; Zbl 1434.68691) Full Text: DOI
Narisada, Shintaro; Hendrian, Diptarama; Yoshinaka, Ryo; Shinohara, Ayumi Linear-time online algorithm for inferring the shortest path graph from a walk label. (English) Zbl 1435.68390 Theor. Comput. Sci. 812, 187-202 (2020). MSC: 68W27 68R10 68W32 PDF BibTeX XML Cite \textit{S. Narisada} et al., Theor. Comput. Sci. 812, 187--202 (2020; Zbl 1435.68390) Full Text: DOI
Ning, Hanwen; Zhang, Jiaming; Feng, Ting-Ting; Chu, Eric King-wah; Tian, Tianhai Control-based algorithms for high dimensional online learning. (English) Zbl 07169819 J. Franklin Inst. 357, No. 3, 1909-1942 (2020). MSC: 68T05 68W27 62-02 93E12 92B20 PDF BibTeX XML Cite \textit{H. Ning} et al., J. Franklin Inst. 357, No. 3, 1909--1942 (2020; Zbl 07169819) Full Text: DOI
Ghuman, Sukhpal Singh; Tarhio, Jorma; Chhabra, Tamanna Improved online algorithms for jumbled matching. (English) Zbl 1434.68692 Discrete Appl. Math. 274, 54-66 (2020). MSC: 68W27 68W32 PDF BibTeX XML Cite \textit{S. S. Ghuman} et al., Discrete Appl. Math. 274, 54--66 (2020; Zbl 1434.68692) Full Text: DOI
Disser, Yann; Mousset, Frank; Noever, Andreas; Škorić, Nemanja; Steger, Angelika A general lower bound for collaborative tree exploration. (English) Zbl 1437.68205 Theor. Comput. Sci. 811, 70-78 (2020). MSC: 68W27 68M14 68R10 68T40 PDF BibTeX XML Cite \textit{Y. Disser} et al., Theor. Comput. Sci. 811, 70--78 (2020; Zbl 1437.68205) Full Text: DOI
Brandt, Sebastian; Foerster, Klaus-Tycho; Richner, Benjamin; Wattenhofer, Roger Wireless evacuation on \(m\) rays with \(k\) searchers. (English) Zbl 1437.68203 Theor. Comput. Sci. 811, 56-69 (2020). MSC: 68W27 68M14 68T40 68U05 PDF BibTeX XML Cite \textit{S. Brandt} et al., Theor. Comput. Sci. 811, 56--69 (2020; Zbl 1437.68203) Full Text: DOI
Bampis, Evripidis (ed.); Megow, Nicole (ed.) Approximation and online algorithms. 17th international workshop, WAOA 2019, Munich, Germany, September 12–13, 2019. Revised selected papers. (English) Zbl 1435.68018 Lecture Notes in Computer Science 11926. Cham: Springer (ISBN 978-3-030-39478-3/pbk; 978-3-030-39479-0/ebook). xii, 253 p. (2020). MSC: 68-06 68W25 68W27 00B25 PDF BibTeX XML Cite \textit{E. Bampis} (ed.) and \textit{N. Megow} (ed.), Approximation and online algorithms. 17th international workshop, WAOA 2019, Munich, Germany, September 12--13, 2019. Revised selected papers. Cham: Springer (2020; Zbl 1435.68018) Full Text: DOI
Rao, Anup; Yehudayoff, Amir Communication complexity and applications. (English) Zbl 1436.68005 Cambridge: Cambridge University Press (ISBN 978-1-108-49798-5/hbk; 978-1-108-67164-4/ebook). xviii, 252 p. (2020). MSC: 68-02 68M14 68Pxx 68Q06 68Q11 68U05 68W15 68W27 68W30 PDF BibTeX XML Cite \textit{A. Rao} and \textit{A. Yehudayoff}, Communication complexity and applications. Cambridge: Cambridge University Press (2020; Zbl 1436.68005) Full Text: DOI
Long, Philip M. New bounds on the price of bandit feedback for mistake-bounded online multiclass learning. (English) Zbl 1436.68153 Theor. Comput. Sci. 808, 159-163 (2020). MSC: 68Q32 62H30 62L15 68T05 68W27 PDF BibTeX XML Cite \textit{P. M. Long}, Theor. Comput. Sci. 808, 159--163 (2020; Zbl 1436.68153) Full Text: DOI
Kotłowski, Wojciech Scale-invariant unconstrained online learning. (English) Zbl 1436.68309 Theor. Comput. Sci. 808, 139-158 (2020). MSC: 68T05 62H30 68W27 90C25 PDF BibTeX XML Cite \textit{W. Kotłowski}, Theor. Comput. Sci. 808, 139--158 (2020; Zbl 1436.68309) Full Text: DOI
Joulani, Pooria; György, András; Szepesvári, Csaba A modular analysis of adaptive (non-)convex optimization: optimism, composite objectives, variance reduction, and variational bounds. (English) Zbl 1436.68306 Theor. Comput. Sci. 808, 108-138 (2020). MSC: 68T05 68W27 90C15 PDF BibTeX XML Cite \textit{P. Joulani} et al., Theor. Comput. Sci. 808, 108--138 (2020; Zbl 1436.68306) Full Text: DOI
Dumitrescu, Adrian; Ghosh, Anirban; Tóth, Csaba D. Online unit covering in Euclidean space. (English) Zbl 1436.68380 Theor. Comput. Sci. 809, 218-230 (2020). MSC: 68U05 68W27 PDF BibTeX XML Cite \textit{A. Dumitrescu} et al., Theor. Comput. Sci. 809, 218--230 (2020; Zbl 1436.68380) Full Text: DOI
Antoniadis, Antonios; Im, Sungjin; Krishnaswamy, Ravishankar; Moseley, Benjamin; Nagarajan, Viswanath; Pruhs, Kirk; Stein, Clifford Hallucination helps: energy efficient virtual circuit routing. (English) Zbl 1448.68178 SIAM J. Comput. 49, No. 1, 37-66 (2020). MSC: 68M20 68M12 68W20 68W25 68W27 PDF BibTeX XML Cite \textit{A. Antoniadis} et al., SIAM J. Comput. 49, No. 1, 37--66 (2020; Zbl 1448.68178) Full Text: DOI
Crochemore, Maxime; Héliou, Alice; Kucherov, Gregory; Mouchard, Laurent; Pissis, Solon P.; Ramusat, Yann Absent words in a sliding window with applications. (English) Zbl 1436.68406 Inf. Comput. 270, Article ID 104461, 14 p. (2020). MSC: 68W32 68W27 PDF BibTeX XML Cite \textit{M. Crochemore} et al., Inf. Comput. 270, Article ID 104461, 14 p. (2020; Zbl 1436.68406) Full Text: DOI
Berndt, Sebastian; Jansen, Klaus; Klein, Kim-Manuel Fully dynamic bin packing revisited. (English) Zbl 07152791 Math. Program. 179, No. 1-2 (A), 109-155 (2020). MSC: 68W27 68W25 PDF BibTeX XML Cite \textit{S. Berndt} et al., Math. Program. 179, No. 1--2 (A), 109--155 (2020; Zbl 07152791) Full Text: DOI
Kobayashi, Koji M. Online interval scheduling to maximize total satisfaction. (English) Zbl 1436.90052 Theor. Comput. Sci. 806, 673-688 (2020). MSC: 90B35 68W27 PDF BibTeX XML Cite \textit{K. M. Kobayashi}, Theor. Comput. Sci. 806, 673--688 (2020; Zbl 1436.90052) Full Text: DOI
Ahmed, Abu Reyan; Saidur Rahman, Md.; Kobourov, Stephen Online facility assignment. (English) Zbl 1436.90073 Theor. Comput. Sci. 806, 455-467 (2020). MSC: 90B80 68W27 PDF BibTeX XML Cite \textit{A. R. Ahmed} et al., Theor. Comput. Sci. 806, 455--467 (2020; Zbl 1436.90073) Full Text: DOI
Bampas, Evangelos; Czyzowicz, Jurek; Ilcinkas, David; Klasing, Ralf Beachcombing on strips and islands. (English) Zbl 1437.68179 Theor. Comput. Sci. 806, 236-255 (2020). MSC: 68U05 68T40 68W25 68W27 PDF BibTeX XML Cite \textit{E. Bampas} et al., Theor. Comput. Sci. 806, 236--255 (2020; Zbl 1437.68179) Full Text: DOI
Brubach, Brian; Sankararaman, Karthik A.; Srinivasan, Aravind; Xu, Pan Attenuate locally, win globally: attenuation-based frameworks for online stochastic matching with timeouts. (English) Zbl 1436.68403 Algorithmica 82, No. 1, 64-87 (2020). MSC: 68W27 05C70 68W20 91B68 PDF BibTeX XML Cite \textit{B. Brubach} et al., Algorithmica 82, No. 1, 64--87 (2020; Zbl 1436.68403) Full Text: DOI
Huynh, Tony; Nelson, Peter The matroid secretary problem for minor-closed classes and random matroids. (English) Zbl 1431.05033 SIAM J. Discrete Math. 34, No. 1, 163-176 (2020). MSC: 05B35 05C80 52B40 68W27 PDF BibTeX XML Cite \textit{T. Huynh} and \textit{P. Nelson}, SIAM J. Discrete Math. 34, No. 1, 163--176 (2020; Zbl 1431.05033) Full Text: DOI arXiv
Tang, Lixin; Li, Feng; Chen, Zhi-Long Integrated scheduling of production and two-stage delivery of make-to-order products: offline and online algorithms. (English) Zbl 07283438 INFORMS J. Comput. 31, No. 3, 493-514 (2019). MSC: 90B35 90C39 90C59 68W27 PDF BibTeX XML Cite \textit{L. Tang} et al., INFORMS J. Comput. 31, No. 3, 493--514 (2019; Zbl 07283438) Full Text: DOI
Nguyen, Thi Thu Thuy; Nguyen, Tien Thanh; Sharma, Rabi; Liew, Alan Wee-Chung A lossless online Bayesian classifier. (English) Zbl 1448.62100 Inf. Sci. 489, 1-17 (2019). MSC: 62H30 68T05 68W27 PDF BibTeX XML Cite \textit{T. T. T. Nguyen} et al., Inf. Sci. 489, 1--17 (2019; Zbl 1448.62100) Full Text: DOI
Osula, Dorota Minimizing the cost of team exploration. (English) Zbl 1444.68019 Catania, Barbara (ed.) et al., SOFSEM 2019: theory and practice of computer science. 45th international conference on current trends in theory and practice of computer science, Nový Smokovec, Slovakia, January 27–30, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11376, 392-405 (2019). MSC: 68M14 68R10 68W27 PDF BibTeX XML Cite \textit{D. Osula}, Lect. Notes Comput. Sci. 11376, 392--405 (2019; Zbl 1444.68019) Full Text: DOI
Zhang, Wenming; Cheng, Yongxi; Ru, Shaofeng The risk-reward model of the online time series search problem. (Chinese. English summary) Zbl 1449.62195 Oper. Res. Trans. 23, No. 3, 126-134 (2019). MSC: 62M10 68W27 62M20 PDF BibTeX XML Cite \textit{W. Zhang} et al., Oper. Res. Trans. 23, No. 3, 126--134 (2019; Zbl 1449.62195) Full Text: DOI
Zhang, Guochuan; Chen, Lin The load balancing problem. (Chinese. English summary) Zbl 1449.90127 Oper. Res. Trans. 23, No. 3, 1-14 (2019). MSC: 90B35 90C27 68W25 68W27 PDF BibTeX XML Cite \textit{G. Zhang} and \textit{L. Chen}, Oper. Res. Trans. 23, No. 3, 1--14 (2019; Zbl 1449.90127) Full Text: DOI
Schneider, Joshua; Basin, David; Brix, Frederik; Krstić, Srđan; Traytel, Dmitriy Adaptive online first-order monitoring. (English) Zbl 1437.68120 Chen, Yu-Fang (ed.) et al., Automated technology for verification and analysis. 17th international symposium, ATVA 2019, Taipei, Taiwan, October 28–31, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11781, 133-150 (2019). MSC: 68Q60 68W27 PDF BibTeX XML Cite \textit{J. Schneider} et al., Lect. Notes Comput. Sci. 11781, 133--150 (2019; Zbl 1437.68120) Full Text: DOI
Tangwongsan, Kanat; Tirthapura, Srikanta Parallel streaming random sampling. (English) Zbl 1437.68206 Yahyapour, Ramin (ed.), Euro-Par 2019: parallel processing. 25th international conference on parallel and distributed computing, Göttingen, Germany, August 26–30, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11725, 451-465 (2019). MSC: 68W27 68W10 68W20 PDF BibTeX XML Cite \textit{K. Tangwongsan} and \textit{S. Tirthapura}, Lect. Notes Comput. Sci. 11725, 451--465 (2019; Zbl 1437.68206) Full Text: DOI
Feige, Uriel Tighter bounds for online bipartite matching. (English) Zbl 07218905 Bárány, Imre (ed.) et al., Building bridges II. Mathematics of László Lovász. Conference in celebration of László Lovász’ 70th birthday, Budapest, Hungary, July 2–6, 2018. Berlin: Springer (ISBN 978-3-662-59203-8/hbk; 978-3-662-59204-5/ebook). Bolyai Society Mathematical Studies 28, 235-255 (2019). MSC: 68W27 05C70 68R10 68W20 68W40 PDF BibTeX XML Cite \textit{U. Feige}, Bolyai Soc. Math. Stud. 28, 235--255 (2019; Zbl 07218905) Full Text: DOI
Bell, Paul C.; Potapov, Igor Towards uniform online spherical tessellations. (English) Zbl 1434.68687 Manea, Florin (ed.) et al., Computing with foresight and industry. 15th conference on computability in Europe, CiE 2019, Durham, UK, July 15–19, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11558, 120-131 (2019). MSC: 68W27 52C20 52C22 68U05 PDF BibTeX XML Cite \textit{P. C. Bell} and \textit{I. Potapov}, Lect. Notes Comput. Sci. 11558, 120--131 (2019; Zbl 1434.68687) Full Text: DOI
Waga, Masaki Online quantitative timed pattern matching with semiring-valued weighted automata. (English) Zbl 1434.68695 André, Étienne (ed.) et al., Formal modeling and analysis of timed systems. 17th international conference, FORMATS 2019, Amsterdam, the Netherlands, August 27–29, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11750, 3-22 (2019). MSC: 68W27 68Q45 68Q60 PDF BibTeX XML Cite \textit{M. Waga}, Lect. Notes Comput. Sci. 11750, 3--22 (2019; Zbl 1434.68695) Full Text: DOI
Kotov, Vladimir M.; Bogdanova, Natallia S. Bunch technique for semionline with two groups of items. (Russian. English summary) Zbl 1434.68694 Zh. Beloruss. Gos. Univ., Mat., Inform. 2019, No. 3, 134-138 (2019). MSC: 68W27 90B35 90C27 PDF BibTeX XML Cite \textit{V. M. Kotov} and \textit{N. S. Bogdanova}, Zh. Beloruss. Gos. Univ., Mat., Inform. 2019, No. 3, 134--138 (2019; Zbl 1434.68694) Full Text: Link
Guo, Zheng-Chu; Shi, Lei Fast and strong convergence of online learning algorithms. (English) Zbl 1433.68344 Adv. Comput. Math. 45, No. 5-6, 2745-2770 (2019). MSC: 68T05 46E22 68W27 PDF BibTeX XML Cite \textit{Z.-C. Guo} and \textit{L. Shi}, Adv. Comput. Math. 45, No. 5--6, 2745--2770 (2019; Zbl 1433.68344) Full Text: DOI
Vasiloudis, Theodore; De Francisci Morales, Gianmarco; Boström, Henrik Quantifying uncertainty in online regression forests. (English) Zbl 1442.68206 J. Mach. Learn. Res. 20, Paper No. 155, 35 p. (2019). MSC: 68T05 62J99 68W27 PDF BibTeX XML Cite \textit{T. Vasiloudis} et al., J. Mach. Learn. Res. 20, Paper No. 155, 35 p. (2019; Zbl 1442.68206) Full Text: Link
Eftekhari, Armin; Ongie, Gregory; Balzano, Laura; Wakin, Michael B. Streaming principal component analysis from incomplete data. (English) Zbl 1441.62159 J. Mach. Learn. Res. 20, Paper No. 86, 62 p. (2019). MSC: 62H25 62D10 62-08 68W27 PDF BibTeX XML Cite \textit{A. Eftekhari} et al., J. Mach. Learn. Res. 20, Paper No. 86, 62 p. (2019; Zbl 1441.62159) Full Text: Link
Klimm, Max; Schmand, Daniel; Tönnis, Andreas The online best reply algorithm for resource allocation problems. (English) Zbl 1431.91185 Fotakis, Dimitris (ed.) et al., Algorithmic game theory. 12th International symposium, SAGT 2019, Athens, Greece, September 30 – October 3, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11801, 200-215 (2019). MSC: 91B32 68W27 91A68 91A14 PDF BibTeX XML Cite \textit{M. Klimm} et al., Lect. Notes Comput. Sci. 11801, 200--215 (2019; Zbl 1431.91185) Full Text: DOI Link
McKay, Dylan M.; Murray, Cody D.; Williams, R. Ryan Weak lower bounds on resource-bounded compression imply strong separations of complexity classes. (English) Zbl 1434.68160 Charikar, Moses (ed.) et al., Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC ’19, Phoenix, AZ, USA, June 23–26, 2019. New York, NY: Association for Computing Machinery (ACM). 1215-1225 (2019). MSC: 68Q06 68P30 68Q15 68Q17 68Q30 68W27 PDF BibTeX XML Cite \textit{D. M. McKay} et al., in: Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC '19, Phoenix, AZ, USA, June 23--26, 2019. New York, NY: Association for Computing Machinery (ACM). 1215--1225 (2019; Zbl 1434.68160) Full Text: DOI
Coester, Christian; Koutsoupias, Elias The online \(k\)-taxi problem. (English) Zbl 1433.68619 Charikar, Moses (ed.) et al., Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC ’19, Phoenix, AZ, USA, June 23–26, 2019. New York, NY: Association for Computing Machinery (ACM). 1136-1147 (2019). MSC: 68W27 68W20 90B35 90C27 PDF BibTeX XML Cite \textit{C. Coester} and \textit{E. Koutsoupias}, in: Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC '19, Phoenix, AZ, USA, June 23--26, 2019. New York, NY: Association for Computing Machinery (ACM). 1136--1147 (2019; Zbl 1433.68619) Full Text: DOI
Bubeck, Sébastien; Lee, Yin Tat; Li, Yuanzhi; Sellke, Mark Competitively chasing convex bodies. (English) Zbl 1434.68688 Charikar, Moses (ed.) et al., Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC ’19, Phoenix, AZ, USA, June 23–26, 2019. New York, NY: Association for Computing Machinery (ACM). 861-868 (2019). MSC: 68W27 52B55 68U05 PDF BibTeX XML Cite \textit{S. Bubeck} et al., in: Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC '19, Phoenix, AZ, USA, June 23--26, 2019. New York, NY: Association for Computing Machinery (ACM). 861--868 (2019; Zbl 1434.68688) Full Text: DOI
Kapralov, Michael; Krachun, Dmitry An optimal space lower bound for approximating MAX-CUT. (English) Zbl 1433.68621 Charikar, Moses (ed.) et al., Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC ’19, Phoenix, AZ, USA, June 23–26, 2019. New York, NY: Association for Computing Machinery (ACM). 277-288 (2019). MSC: 68W27 68Q17 68R10 68W20 68W25 PDF BibTeX XML Cite \textit{M. Kapralov} and \textit{D. Krachun}, in: Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC '19, Phoenix, AZ, USA, June 23--26, 2019. New York, NY: Association for Computing Machinery (ACM). 277--288 (2019; Zbl 1433.68621) Full Text: DOI
Assadi, Sepehr; Chen, Yu; Khanna, Sanjeev Polynomial pass lower bounds for graph streaming algorithms. (English) Zbl 1433.68617 Charikar, Moses (ed.) et al., Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC ’19, Phoenix, AZ, USA, June 23–26, 2019. New York, NY: Association for Computing Machinery (ACM). 265-276 (2019). MSC: 68W27 68Q11 68Q17 68R10 PDF BibTeX XML Cite \textit{S. Assadi} et al., in: Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC '19, Phoenix, AZ, USA, June 23--26, 2019. New York, NY: Association for Computing Machinery (ACM). 265--276 (2019; Zbl 1433.68617) Full Text: DOI
Abboud, Amir; Addanki, Raghavendra; Grandoni, Fabrizio; Panigrahi, Debmalya; Saha, Barna Dynamic set cover: improved algorithms and lower bounds. (English) Zbl 1433.68616 Charikar, Moses (ed.) et al., Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC ’19, Phoenix, AZ, USA, June 23–26, 2019. New York, NY: Association for Computing Machinery (ACM). 114-125 (2019). MSC: 68W27 68Q17 68W20 68W25 68W40 90C27 PDF BibTeX XML Cite \textit{A. Abboud} et al., in: Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC '19, Phoenix, AZ, USA, June 23--26, 2019. New York, NY: Association for Computing Machinery (ACM). 114--125 (2019; Zbl 1433.68616) Full Text: DOI
Liu, Yun; Yi, Song Research on optimization of double transform algorithm in multidimensional sequence data analysis. (Chinese. English summary) Zbl 1449.68147 J. Sichuan Univ., Nat. Sci. Ed. 56, No. 4, 633-638 (2019). MSC: 68W27 68T05 PDF BibTeX XML Cite \textit{Y. Liu} and \textit{S. Yi}, J. Sichuan Univ., Nat. Sci. Ed. 56, No. 4, 633--638 (2019; Zbl 1449.68147) Full Text: DOI
Huang, Chien-Chung; Kakimura, Naonori Improved streaming algorithms for maximizing monotone submodular functions under a knapsack constraint. (English) Zbl 1435.68388 Friggstad, Zachary (ed.) et al., Algorithms and data structures. 16th international symposium, WADS 2019, Edmonton, AB, Canada, August 5–7, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11646, 438-451 (2019). MSC: 68W27 68W25 90C27 PDF BibTeX XML Cite \textit{C.-C. Huang} and \textit{N. Kakimura}, Lect. Notes Comput. Sci. 11646, 438--451 (2019; Zbl 1435.68388) Full Text: DOI
Gurski, Frank; Rehs, Carolin; Rethmann, Jochen; Wanke, Egon Controlling distribution conveyors and multiline palletizers: theoretical foundations and online algorithms. (English) Zbl 1428.90024 OR Spectrum 41, No. 2, 581-611 (2019). MSC: 90B06 90C27 90C60 68W27 90C10 PDF BibTeX XML Cite \textit{F. Gurski} et al., OR Spectrum 41, No. 2, 581--611 (2019; Zbl 1428.90024) Full Text: DOI
Dereniowski, Dariusz; Osula, Dorota On-line search in two-dimensional environment. (English) Zbl 1436.68404 Theory Comput. Syst. 63, No. 8, 1819-1848 (2019). MSC: 68W27 68R10 68W15 91A24 91A43 PDF BibTeX XML Cite \textit{D. Dereniowski} and \textit{D. Osula}, Theory Comput. Syst. 63, No. 8, 1819--1848 (2019; Zbl 1436.68404) Full Text: DOI
Borodin, Allan; Pankratov, Denis; Salehi-Abari, Amirali On conceptually simple algorithms for variants of online bipartite matching. (English) Zbl 1429.91230 Theory Comput. Syst. 63, No. 8, 1781-1818 (2019). MSC: 91B68 05C70 68W20 68W25 68W27 PDF BibTeX XML Cite \textit{A. Borodin} et al., Theory Comput. Syst. 63, No. 8, 1781--1818 (2019; Zbl 1429.91230) Full Text: DOI
Balogh, János; Békési, József; Dósa, György; Epstein, Leah; Levin, Asaf Lower bounds for several online variants of bin packing. (English) Zbl 1436.68402 Theory Comput. Syst. 63, No. 8, 1757-1780 (2019). MSC: 68W27 68Q17 90C27 PDF BibTeX XML Cite \textit{J. Balogh} et al., Theory Comput. Syst. 63, No. 8, 1757--1780 (2019; Zbl 1436.68402) Full Text: DOI
Solis-Oba, Roberto (ed.); Fleischer, Rudolf (ed.) Guest editorial: Special issue on approximation and online algorithms. (English) Zbl 1436.68034 Theory Comput. Syst. 63, No. 8, 1755-1756 (2019). MSC: 68-06 68W25 68W27 00B25 PDF BibTeX XML Cite \textit{R. Solis-Oba} (ed.) and \textit{R. Fleischer} (ed.), Theory Comput. Syst. 63, No. 8, 1755--1756 (2019; Zbl 1436.68034) Full Text: DOI
Bergé, Pierre; Desmarchelier, Jean; Guo, Wen; Lefebvre, Aurélie; Rimmel, Arpad; Tomasik, Joanna Multiple canadians on the road: minimizing the distance competitive ratio. (English) Zbl 1432.90130 J. Comb. Optim. 38, No. 4, 1086-1100 (2019). MSC: 90C27 90C35 68R10 68W27 PDF BibTeX XML Cite \textit{P. Bergé} et al., J. Comb. Optim. 38, No. 4, 1086--1100 (2019; Zbl 1432.90130) Full Text: DOI
Janson, Svante The hiring problem with rank-based strategies. (English) Zbl 1432.60020 Electron. J. Probab. 24, Paper No. 125, 35 p. (2019). Reviewer: Yilun Shang (Newcastle) MSC: 60C05 68W40 62L10 68W27 PDF BibTeX XML Cite \textit{S. Janson}, Electron. J. Probab. 24, Paper No. 125, 35 p. (2019; Zbl 1432.60020) Full Text: DOI Euclid arXiv