{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T02:10:04Z","timestamp":1750299004933,"version":"3.41.0"},"reference-count":45,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2024,12,27]],"date-time":"2024-12-27T00:00:00Z","timestamp":1735257600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGACT News"],"published-print":{"date-parts":[[2024,12,27]]},"abstract":"<jats:p>In this column, we will discuss some papers in online algorithms that appeared in 2024. As usual, we make no claim at complete coverage here, and have instead made a selection. If we have unaccountably missed your favorite paper and you would like to write about it or about any other topic in online algorithms, please don't hesitate to contact us!<\/jats:p>","DOI":"10.1145\/3710795.3710803","type":"journal-article","created":{"date-parts":[[2024,12,27]],"date-time":"2024-12-27T23:18:59Z","timestamp":1735341539000},"page":"94-107","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["SIGACT News Online Algorithms Column 43: 2024 in review"],"prefix":"10.1145","volume":"55","author":[{"given":"Aflatoun","family":"Amouzandeh","sequence":"first","affiliation":[{"name":"University of Siegen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00f6ren","family":"Schmitt","sequence":"additional","affiliation":[{"name":"University of Siegen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rob","family":"van Stee","sequence":"additional","affiliation":[{"name":"University of Siegen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,12,27]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977554.ch69"},{"key":"e_1_2_1_2_1","first-page":"1","volume-title":"32nd Annual European Symposium on Algorithms, ESA 2024, September 2--4","volume":"308","author":"Abrahamsen Mikkel","year":"2024","unstructured":"Mikkel Abrahamsen, Ioana O. Bercea, Lorenzo Beretta, Jonas Klausen, and L\u00b4aszl\u00b4o Kozma. Online sorting and online TSP: randomized, stochastic, and high-dimensional. In Timothy Chan, Johannes Fischer, John Iacono, and Grzegorz Herman, editors, 32nd Annual European Symposium on Algorithms, ESA 2024, September 2--4, 2024, Royal Holloway, London, United Kingdom, volume 308 of LIPIcs, pages 5:1--5:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00a8ur Informatik, 2024."},{"key":"e_1_2_1_3_1","first-page":"77","volume-title":"Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2024","author":"Agrawal Kunal","year":"2024","unstructured":"Kunal Agrawal, Benjamin Moseley, Heather Newman, and Kirk Pruhs. Scheduling out-trees online to optimize maximum flow. In Kunal Agrawal and Erez Petrank, editors, Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2024, Nantes, France, June 17--21, 2024, pages 77--88. ACM, 2024."},{"key":"e_1_2_1_4_1","series-title":"Lecture Notes in Computer Science","volume-title":"Approximation and Online Algorithms - 22nd International Workshop, WAOA","author":"Amouzandeh Aflatoun","year":"2024","unstructured":"Aflatoun Amouzandeh and Rob van Stee. Improved online scheduling with restarts on a single machine. In Marcin Bie\u00b4nkowski and Matthias Englert, editors, Approximation and Online Algorithms - 22nd International Workshop, WAOA 2024, London, UK, September 5--6, 2024, Proceedings, Lecture Notes in Computer Science. Springer, 2024. To appear."},{"key":"e_1_2_1_5_1","first-page":"1","volume-title":"51st International Colloquium on Automata, Languages, and Programming, ICALP 2024","volume":"297","author":"Azar Yossi","year":"2024","unstructured":"Yossi Azar, Shahar Lewkowicz, and Danny Vainstein. List update with delays or time windows. In Karl Bringmann, Martin Grohe, Gabriele Puppis, and Ola Svensson, editors, 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, July 8--12, 2024, Tallinn, Estonia, volume 297 of LIPIcs, pages 15:1--15:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00a8ur Informatik, 2024."},{"key":"e_1_2_1_6_1","first-page":"1","volume-title":"49th International Colloquium on Automata, Languages, and Programming, ICALP 2022","volume":"229","author":"Azar Yossi","year":"2022","unstructured":"Yossi Azar, Chay Machluf, Boaz Patt-Shamir, and Noam Touitou. Competitive vertex recoloring. In Mikolaj Bojanczyk, Emanuela Merelli, and David P. Woodruff, editors, 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, July 4--8, 2022, Paris, France, volume 229 of LIPIcs, pages 13:1--13:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00a8ur Informatik, 2022."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90209-E"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/3174304.3175331"},{"key":"e_1_2_1_9_1","doi-asserted-by":"crossref","first-page":"4564","DOI":"10.1137\/1.9781611977912.162","volume-title":"Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA","author":"Bhore Sujoy","year":"2024","unstructured":"Sujoy Bhore, Arnold Filtser, and Csaba D. T\u00b4oth. Online duet between metric embeddings and minimumweight perfect matchings. In David P.Woodruff, editor, Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, Alexandria, VA, USA, January 7--10, 2024, pages 4564--4579. SIAM, 2024."},{"key":"e_1_2_1_10_1","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1145\/3618260.3649741","volume-title":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing, STOC 2024","author":"Blikstad Joakim","year":"2024","unstructured":"Joakim Blikstad, Ola Svensson, Radu Vintan, and David Wajc. Online edge coloring is (nearly) as easy as offline. In Bojan Mohar, Igor Shinkar, and Ryan O'Donnell, editors, Proceedings of the 56th Annual ACM Symposium on Theory of Computing, STOC 2024, Vancouver, BC, Canada, June 24--28, 2024, pages 36--46. ACM, 2024."},{"key":"e_1_2_1_11_1","unstructured":"Martin B\u00a8ohm Matej Lieskovsk\u00b4y S\u00a8oren Schmitt and Rob van Stee. Improved online load balancing with known makespan. In Amit Kumar and Noga Ron-Zewi editors Approximation Randomization and Combinatorial Optimization. Algorithms and Techniques APPROX\/RANDOM 2024 August 28--30 2024 London School of Economics London UK volume 317 of LIPIcs pages 10:1--10:21. Schloss Dagstuhl - Leibniz-Zentrum f\u00a8ur Informatik 2024."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-017-0114-4"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-020-00698-3"},{"key":"e_1_2_1_14_1","doi-asserted-by":"crossref","first-page":"4283","DOI":"10.1137\/1.9781611977912.149","volume-title":"Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA","author":"Buchbinder Niv","year":"2024","unstructured":"Niv Buchbinder, Anupam Gupta, Daniel Hathcock, Anna R. Karlin, and Sherry Sarkar. Maintaining matroid intersections online. In David P. Woodruff, editor, Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, Alexandria, VA, USA, January 7--10, 2024, pages 4283--4304. SIAM, 2024."},{"key":"e_1_2_1_15_1","first-page":"1","volume-title":"32nd Annual European Symposium on Algorithms, ESA 2024, September 2--4","volume":"308","author":"Calinescu Gruia","year":"2024","unstructured":"Gruia Calinescu, Sami Davies, Samir Khuller, and Shirley Zhang. Online flexible busy time scheduling on heterogeneous machines. In Timothy Chan, Johannes Fischer, John Iacono, and Grzegorz Herman, editors, 32nd Annual European Symposium on Algorithms, ESA 2024, September 2--4, 2024, Royal Holloway, London, United Kingdom, volume 308 of LIPIcs, pages 37:1--37:18. Schloss Dagstuhl - Leibniz- Zentrum f\u00a8ur Informatik, 2024."},{"key":"e_1_2_1_16_1","unstructured":"Shuchi Chawla and Dimitris Christou. Online time-windows TSP with predictions. In Amit Kumar and Noga Ron-Zewi editors Approximation Randomization and Combinatorial Optimization. Algorithms and Techniques APPROX\/RANDOM 2024 August 28--30 2024 London School of Economics London UK volume 317 of LIPIcs pages 2:1--2:21. Schloss Dagstuhl - Leibniz-Zentrum f\u00a8ur Informatik 2024."},{"key":"e_1_2_1_17_1","first-page":"1","volume-title":"60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019","author":"Cohen Ilan Reuven","year":"2019","unstructured":"Ilan Reuven Cohen, Binghui Peng, and David Wajc. Tight bounds for online edge coloring. In David Zuckerman, editor, 60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019, Baltimore, Maryland, USA, November 9--12, 2019, pages 1--25. IEEE Computer Society, 2019."},{"key":"e_1_2_1_18_1","doi-asserted-by":"crossref","first-page":"4264","DOI":"10.1137\/1.9781611977912.148","volume-title":"Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA","author":"Cosson Romain","year":"2024","unstructured":"Romain Cosson. Breaking the k\/ log k barrier in collective tree exploration via tree-mining. In David P. Woodruff, editor, Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, Alexandria, VA, USA, January 7--10, 2024, pages 4264--4282. SIAM, 2024."},{"key":"e_1_2_1_19_1","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1145\/3618260.3649773","volume-title":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing, STOC 2024","author":"Cristi Andr\u00b4es","year":"2024","unstructured":"Andr\u00b4es Cristi and Bruno Ziliotto. Prophet inequalities require only a constant number of samples. In Bojan Mohar, Igor Shinkar, and Ryan O'Donnell, editors, Proceedings of the 56th Annual ACM Symposium on Theory of Computing, STOC 2024, Vancouver, BC, Canada, June 24--28, 2024, pages 491--502. ACM, 2024."},{"key":"e_1_2_1_20_1","doi-asserted-by":"crossref","first-page":"4247","DOI":"10.1137\/1.9781611977912.147","volume-title":"Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA","author":"Dinitz Michael","year":"2024","unstructured":"Michael Dinitz, Sungjin Im, Thomas Lavastida, Benjamin Moseley, and Sergei Vassilvitskii. Controlling tail risk in online ski-rental. In David P. Woodruff, editor, Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, Alexandria, VA, USA, January 7--10, 2024, pages 4247--4263. SIAM, 2024."},{"key":"e_1_2_1_21_1","first-page":"1","volume-title":"51st International Colloquium on Automata, Languages, and Programming, ICALP 2024","volume":"297","author":"Doron-Arad Ilan","year":"2024","unstructured":"Ilan Doron-Arad and Joseph (Seffi) Naor. Non-linear paging. In Karl Bringmann, Martin Grohe, Gabriele Puppis, and Ola Svensson, editors, 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, July 8--12, 2024, Tallinn, Estonia, volume 297 of LIPIcs, pages 57:1-- 57:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00a8ur Informatik, 2024."},{"key":"e_1_2_1_22_1","volume-title":"50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009","author":"Feldman Jon","year":"2009","unstructured":"Jon Feldman, Aranyak Mehta, Vahab S. Mirrokni, and S. Muthukrishnan. Online stochastic matching: Beating 1--1\/e. In 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, October 25--27, 2009, Atlanta, Georgia, USA, pages 117--126. IEEE Computer Society, 2009."},{"key":"e_1_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Pierre Fraigniaud Leszek Gasieniec Dariusz R. Kowalski and Andrzej Pelc. Collective tree exploration. In Martin Farach-Colton editor LATIN 2004: Theoretical Informatics 6th Latin American Symposium Buenos Aires Argentina April 5--8 2004 Proceedings volume 2976 of Lecture Notes in Computer Science pages 141--151. Springer 2004.","DOI":"10.1007\/978-3-540-24698-5_18"},{"key":"e_1_2_1_24_1","doi-asserted-by":"crossref","first-page":"1253","DOI":"10.1109\/FOCS52979.2021.00122","volume-title":"62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021","author":"Gupta Anupam","year":"2022","unstructured":"Anupam Gupta, Gregory Kehne, and Roie Levin. Random order online set cover is as easy as offline. In 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, February 7--10, 2022, pages 1253--1264. IEEE, 2021."},{"key":"e_1_2_1_25_1","doi-asserted-by":"crossref","first-page":"4530","DOI":"10.1137\/1.9781611977912.160","volume-title":"Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA","author":"Gupta Anupam","year":"2024","unstructured":"Anupam Gupta, Gregory Kehne, and Roie Levin. Set covering with our eyes wide shut. In David P. Woodruff, editor, Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, Alexandria, VA, USA, January 7--10, 2024, pages 4530--4553. SIAM, 2024."},{"key":"e_1_2_1_26_1","doi-asserted-by":"crossref","first-page":"4220","DOI":"10.1137\/1.9781611977912.146","volume-title":"Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA","author":"Gupta Anupam","year":"2024","unstructured":"Anupam Gupta, Amit Kumar, and Debmalya Panigrahi. Poly-logarithmic competitiveness for the k-taxi problem. In David P. Woodruff, editor, Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, Alexandria, VA, USA, January 7--10, 2024, pages 4220--4246. SIAM, 2024."},{"key":"e_1_2_1_27_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1007\/978-3-642-25510-6_15","volume-title":"Internet and Network Economics - 7th International Workshop, WINE","author":"Haeupler Bernhard","year":"2011","unstructured":"Bernhard Haeupler, Vahab S. Mirrokni, and Morteza Zadimoghaddam. Online stochastic weighted matching: Improved approximation algorithms. In Ning Chen, Edith Elkind, and Elias Koutsoupias, editors, Internet and Network Economics - 7th International Workshop, WINE 2011, Singapore, December 11--14, 2011. Proceedings, volume 7090 of Lecture Notes in Computer Science, pages 170--181. Springer, 2011."},{"key":"e_1_2_1_28_1","first-page":"1","volume-title":"51st International Colloquium on Automata, Languages, and Programming, ICALP 2024","volume":"297","author":"Har-Peled Sariel","year":"2024","unstructured":"Sariel Har-Peled, Elfarouk Harb, and Vasilis Livanos. Oracle-augmented prophet inequalities. In Karl Bringmann, Martin Grohe, Gabriele Puppis, and Ola Svensson, editors, 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, July 8--12, 2024, Tallinn, Estonia, volume 297 of LIPIcs, pages 81:1--81:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00a8ur Informatik, 2024."},{"key":"e_1_2_1_29_1","doi-asserted-by":"crossref","first-page":"4177","DOI":"10.1137\/1.9781611977912.145","volume-title":"Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA","author":"Hebbar Anish","year":"2024","unstructured":"Anish Hebbar, Arindam Khan, and K. V. N. Sreenivas. Bin packing under random-order: Breaking the barrier of 3\/2. In David P. Woodruff, editor, Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, Alexandria, VA, USA, January 7--10, 2024, pages 4177--4219. SIAM, 2024."},{"key":"e_1_2_1_30_1","doi-asserted-by":"crossref","first-page":"682","DOI":"10.1145\/3406325.3451079","volume-title":"STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing","author":"Huang Zhiyi","year":"2021","unstructured":"Zhiyi Huang and Xinkai Shu. Online stochastic matching, poisson arrivals, and the natural linear program. In Samir Khuller and Virginia Vassilevska Williams, editors, STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21--25, 2021, pages 682--693. ACM, 2021."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3520046"},{"key":"e_1_2_1_32_1","first-page":"491","volume-title":"Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2024","author":"Im Sungjin","year":"2024","unstructured":"Sungjin Im, Ravi Kumar, Shi Li, Aditya Petety, and Manish Purohit. Online load and graph balancing for random order inputs. In Kunal Agrawal and Erez Petrank, editors, Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2024, Nantes, France, June 17--21, 2024, pages 491--497. ACM, 2024."},{"key":"e_1_2_1_33_1","doi-asserted-by":"crossref","first-page":"3197","DOI":"10.1137\/1.9781611977912.115","volume-title":"Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA","author":"Kane Daniel M.","year":"2024","unstructured":"Daniel M. Kane, Ilias Diakonikolas, Hanshen Xiao, and Sihan Liu. Online robust mean estimation. In David P. Woodruff, editor, Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, Alexandria, VA, USA, January 7--10, 2024, pages 3197--3235. SIAM, 2024."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/313852.314083"},{"key":"e_1_2_1_35_1","doi-asserted-by":"crossref","first-page":"1832","DOI":"10.1145\/3618260.3649720","volume-title":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing, STOC 2024","author":"Kulkarni Janardhan","year":"2024","unstructured":"Janardhan Kulkarni, Victor Reis, and Thomas Rothvoss. Optimal online discrepancy minimization. In Proceedings of the 56th Annual ACM Symposium on Theory of Computing, STOC 2024, page 1832--1840, New York, NY, USA, 2024. Association for Computing Machinery."},{"key":"e_1_2_1_36_1","volume-title":"Online deterministic minimum cost bipartite matching with delays on a line. CoRR, abs\/2408.02526","author":"Kuo Tung-Wei","year":"2024","unstructured":"Tung-Wei Kuo. Online deterministic minimum cost bipartite matching with delays on a line. CoRR, abs\/2408.02526, 2024."},{"key":"e_1_2_1_37_1","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1137\/1.9781611977912.17","volume-title":"Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA","author":"Livanos Vasilis","year":"2024","unstructured":"Vasilis Livanos and Ruta Mehta. Minimization is harder in the prophet world. In David P.Woodruff, editor, Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, Alexandria, VA, USA, January 7--10, 2024, pages 424--461. SIAM, 2024."},{"key":"e_1_2_1_38_1","doi-asserted-by":"crossref","first-page":"1629","DOI":"10.1145\/3618260.3649788","volume-title":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing, STOC 2024","author":"MacRury Calum","year":"2024","unstructured":"Calum MacRury and Will Ma. Random-order contention resolution via continuous induction: Tightness for bipartite matching under vertex arrivals. In Bojan Mohar, Igor Shinkar, and Ryan O'Donnell, editors, Proceedings of the 56th Annual ACM Symposium on Theory of Computing, STOC 2024, Vancouver, BC, Canada, June 24--28, 2024, pages 1629--1640. ACM, 2024."},{"key":"e_1_2_1_39_1","unstructured":"Benjamin Moseley Heather Newman and Kirk Pruhs. Online k-median with consistent clusters. In Amit Kumar and Noga Ron-Zewi editors Approximation Randomization and Combinatorial Optimization. Algorithms and Techniques APPROX\/RANDOM 2024 August 28--30 2024 London School of Economics London UK volume 317 of LIPIcs pages 20:1--20:22. Schloss Dagstuhl - Leibniz-Zentrum f\u00a8ur Informatik 2024."},{"key":"e_1_2_1_40_1","unstructured":"Sharath Raghvendra. A robust and optimal online algorithm for minimum metric bipartite matching. In Klaus Jansen Claire Mathieu Jos\u00b4e D. P. Rolim and Chris Umans editors Approximation Randomization and Combinatorial Optimization. Algorithms and Techniques APPROX\/RANDOM 2016 September 7--9 2016 Paris France volume 60 of LIPIcs pages 18:1--18:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00a8ur Informatik 2016."},{"key":"e_1_2_1_41_1","first-page":"1","volume-title":"32nd Annual European Symposium on Algorithms, ESA 2024, September 2--4","volume":"308","author":"Rajaraman Rajmohan","year":"2024","unstructured":"Rajmohan Rajaraman and Omer Wasim. Competitive capacitated online recoloring. In Timothy Chan, Johannes Fischer, John Iacono, and Grzegorz Herman, editors, 32nd Annual European Symposium on Algorithms, ESA 2024, September 2--4, 2024, Royal Holloway, London, United Kingdom, volume 308 of LIPIcs, pages 95:1--95:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00a8ur Informatik, 2024"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2786.2793"},{"key":"e_1_2_1_43_1","first-page":"25","article-title":"On an estimate of the chromatic class of a p-graph","volume":"3","author":"Vizing Vadim G.","year":"1964","unstructured":"Vadim G. Vizing. On an estimate of the chromatic class of a p-graph. Metody Diskret. Analiz., 3:25--30, 1964.","journal-title":"Metody Diskret. Analiz."},{"key":"e_1_2_1_44_1","volume-title":"Online string attractors. CoRR, abs\/2407.15599","author":"Whittington Philip","year":"2024","unstructured":"Philip Whittington. Online string attractors. CoRR, abs\/2407.15599, 2024."},{"key":"e_1_2_1_45_1","first-page":"4631","volume-title":"Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Yan Shuyi","year":"2024","unstructured":"Shuyi Yan. Edge-weighted online stochastic matching: Beating 1? 1 e . In Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 4631--4640, 2024."}],"container-title":["ACM SIGACT News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3710795.3710803","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3710795.3710803","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:57:25Z","timestamp":1750298245000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3710795.3710803"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,27]]},"references-count":45,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,12,27]]}},"alternative-id":["10.1145\/3710795.3710803"],"URL":"https:\/\/doi.org\/10.1145\/3710795.3710803","relation":{},"ISSN":["0163-5700"],"issn-type":[{"type":"print","value":"0163-5700"}],"subject":[],"published":{"date-parts":[[2024,12,27]]},"assertion":[{"value":"2024-12-27","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}