{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:18:33Z","timestamp":1750306713204,"version":"3.41.0"},"reference-count":18,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2014,9,17]],"date-time":"2014-09-17T00:00:00Z","timestamp":1410912000000},"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":[[2014,9,17]]},"abstract":"<jats:p>In this column, I will discuss some recent papers in online algorithms. It is pleasing to see there were a number of papers about online algorithms in the top conferences this year. If I have missed your paper and you want to write about it or about any other topic in online algorithms, don't hesitate to contact me!<\/jats:p>","DOI":"10.1145\/2670418.2670441","type":"journal-article","created":{"date-parts":[[2014,9,19]],"date-time":"2014-09-19T12:27:17Z","timestamp":1411129637000},"page":"105-111","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["SIGACT news online algorithms column 24"],"prefix":"10.1145","volume":"45","author":[{"given":"Rob","family":"van Stee","sequence":"first","affiliation":[{"name":"University of Leicester, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2014,9,17]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214031"},{"volume-title":"Albers and Matthias Hellwig. Online Makespan Minimization with Parallel Schedules. SWAT 2014: 13--25","author":"Susanne","key":"e_1_2_1_2_1"},{"volume-title":"Avigdor-Elgrabli and Yuval Rabani. A Constant Factor Approximation Algorithm for Reordering Buffer Management. SODA 2013: 973--984","author":"Noa","key":"e_1_2_1_3_1"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.9"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700369387"},{"volume-title":"Stephane Durocher and Perouz Taslakian. Competitive Online Routing on Delaunay Triangulations. SWAT 2014: 98--109","author":"Bose Prosenjit","key":"e_1_2_1_6_1"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591880"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491533.2491557"},{"volume-title":"ICALP 2014: 465--476","author":"Esfandiari Hossein","key":"e_1_2_1_9_1"},{"volume-title":"ICALP 2014: 508--519","author":"G\u00f6bel Oliver","key":"e_1_2_1_10_1"},{"volume-title":"SODA 2014: 455--467","author":"Gupta Anupam","key":"e_1_2_1_11_1"},{"volume-title":"SODA 2014: 468--479","author":"Gupta Anupam","key":"e_1_2_1_12_1"},{"volume-title":"ICALP 2014: 576--587","author":"HajiAghayi MohammadTaghi","key":"e_1_2_1_13_1"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591810"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02930-1_42"},{"volume-title":"ICALP 2011: 37--48","author":"Qian Jiawei","key":"e_1_2_1_16_1"},{"volume-title":"ESA 2002: 820--832","author":"R\u00e4cke Harald","key":"e_1_2_1_17_1"},{"key":"e_1_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Martin B\u00f6hm Ji\u0159\u00ed Sgall Rob van Stee Pavel Vesely. Better algorithms for online bin stretching. To appear in WAOA 2014.  Martin B\u00f6hm Ji\u0159\u00ed Sgall Rob van Stee Pavel Vesely. Better algorithms for online bin stretching. To appear in WAOA 2014.","DOI":"10.1007\/978-3-319-18263-6_3"}],"container-title":["ACM SIGACT News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2670418.2670441","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2670418.2670441","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:19:20Z","timestamp":1750231160000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2670418.2670441"}},"subtitle":["2014 so far"],"short-title":[],"issued":{"date-parts":[[2014,9,17]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,9,17]]}},"alternative-id":["10.1145\/2670418.2670441"],"URL":"https:\/\/doi.org\/10.1145\/2670418.2670441","relation":{},"ISSN":["0163-5700"],"issn-type":[{"type":"print","value":"0163-5700"}],"subject":[],"published":{"date-parts":[[2014,9,17]]},"assertion":[{"value":"2014-09-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}