{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:07:31Z","timestamp":1750306051476,"version":"3.41.0"},"reference-count":26,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2017,3,10]],"date-time":"2017-03-10T00:00:00Z","timestamp":1489104000000},"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":[[2017,3,10]]},"abstract":"<jats:p>In this column, I will discuss some recent papers in online algorithms that appeared in 2016. Quite a number of papers on online algorithms appeared during the year, and I have had to make a selection; I am sure to have overlooked some papers. If I 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 me!<\/jats:p>","DOI":"10.1145\/3061640.3061650","type":"journal-article","created":{"date-parts":[[2017,3,13]],"date-time":"2017-03-13T12:25:15Z","timestamp":1489407915000},"page":"46-53","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["SIGACT News Online Algorithms Column 30"],"prefix":"10.1145","volume":"48","author":[{"given":"Rob","family":"van Stee","sequence":"first","affiliation":[{"name":"University of Leicester, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2017,3,10]]},"reference":[{"key":"e_1_2_1_1_1","first-page":"176","volume-title":"SODA","author":"Agrawal Kunal","year":"2016"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2935764.2935782"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/060661946"},{"key":"e_1_2_1_4_1","first-page":"761","volume-title":"SODA","author":"Andelman Nir","year":"2003"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973105.6"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.24"},{"key":"e_1_2_1_7_1","unstructured":"Marcin\n       \n      Bienkowski Martin\n       \n      B\u00f6hm Jaroslaw\n       \n      Byrka Marek\n       \n      Chrobak Christoph\n       \n      D\u00fcrr Lukas\n       \n      Folwarczny Lukasz ez Ji\u0159\u00ed Sgall Nguyen Kim Thang and Pavel Vesely. Online Algorithms for Multi-Level Aggregation. In Piotr Sankowski and Christos Zaroliagis editors 24th Annual European Symposium on Algorithms (ESA\n   \n  2016\n  ) volume \n  57\n   of \n  Leibniz International Proceedings in Informatics (LIPIcs) pages 12:\n  1\n  --\n  12\n  :17 Dagstuhl Germany 2016. Schloss Dagstuhl--Leibniz-Zentrum f\u00fcr \n  Informatik\n  . doi:http:\/\/dx.doi.org\/10.4230\/LIPIcs.ESA.2016.12  Marcin Bienkowski Martin B\u00f6hm Jaroslaw Byrka Marek Chrobak Christoph D\u00fcrr Lukas Folwarczny Lukasz ez Ji\u0159\u00ed Sgall Nguyen Kim Thang and Pavel Vesely. Online Algorithms for Multi-Level Aggregation. In Piotr Sankowski and Christos Zaroliagis editors 24th Annual European Symposium on Algorithms (ESA 2016) volume 57 of Leibniz International Proceedings in Informatics (LIPIcs) pages 12:1--12:17 Dagstuhl Germany 2016. Schloss Dagstuhl--Leibniz-Zentrum f\u00fcr Informatik. doi:http:\/\/dx.doi.org\/10.4230\/LIPIcs.ESA.2016.12"},{"key":"e_1_2_1_8_1","series-title":"LIPIcs","first-page":"1","volume-title":"ISAAC","author":"B\u00f6hm Martin","year":"2016"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2993749.2993766"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000024"},{"key":"e_1_2_1_11_1","first-page":"155","volume-title":"SODA","author":"Chen Lin","year":"2016"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2935764.2935786"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-003-1025-6"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2016.12.001"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch15"},{"key":"e_1_2_1_16_1","series-title":"LIPIcs","first-page":"1","volume-title":"ICALP","author":"Dehghani Sina","year":"2016"},{"key":"e_1_2_1_17_1","first-page":"164","volume-title":"SODA","author":"Dehghani Sina","year":"2016"},{"key":"e_1_2_1_18_1","series-title":"LIPIcs","first-page":"1","volume-title":"ESA","author":"D\u00fcrr Christoph","year":"2016"},{"key":"e_1_2_1_19_1","first-page":"209","volume-title":"SODA","author":"Englert Matthias","year":"2007"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch72"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1753171.1753195"},{"key":"e_1_2_1_22_1","first-page":"434","volume-title":"Conference on Information Sciences and Systems","author":"Hajek Bruce","year":"2001"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100262"},{"key":"e_1_2_1_24_1","series-title":"LIPIcs","first-page":"1","volume-title":"ESA","author":"Lucarelli Giorgio","year":"2016"},{"key":"e_1_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Akira\n       \n      Matsubayashi\n    .\n      \n  \n   \n  Non-greedy online Steiner trees on outerplanar graphs. InWAOA volume \n  10138\n   of \n  Lecture Notes in Computer Science pages \n  129\n  --\n  141\n  . \n  Springer 2016\n  .  Akira Matsubayashi. Non-greedy online Steiner trees on outerplanar graphs. InWAOA volume 10138 of Lecture Notes in Computer Science pages 129--141. Springer 2016.","DOI":"10.1007\/978-3-319-51741-4_11"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258570"}],"container-title":["ACM SIGACT News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3061640.3061650","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3061640.3061650","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:03:27Z","timestamp":1750215807000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3061640.3061650"}},"subtitle":["2016 in review"],"short-title":[],"issued":{"date-parts":[[2017,3,10]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,3,10]]}},"alternative-id":["10.1145\/3061640.3061650"],"URL":"https:\/\/doi.org\/10.1145\/3061640.3061650","relation":{},"ISSN":["0163-5700"],"issn-type":[{"type":"print","value":"0163-5700"}],"subject":[],"published":{"date-parts":[[2017,3,10]]},"assertion":[{"value":"2017-03-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}