{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:21:21Z","timestamp":1750306881117,"version":"3.41.0"},"reference-count":16,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2012,12,19]],"date-time":"2012-12-19T00:00:00Z","timestamp":1355875200000},"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":[[2012,12,19]]},"abstract":"<jats:p>\n            For this column, I would like to report on some conferences that I attended recently, with special attention given (of course) to results in online algorithms. Most of the papers discussed below consider online scheduling, another favorite problem area of mine. Generally, for a job\n            <jats:italic>j<\/jats:italic>\n            we will denote its processing time by\n            <jats:italic>pj<\/jats:italic>\n            , its weight by\n            <jats:italic>wj<\/jats:italic>\n            (if applicable), its release time by\n            <jats:italic>rj<\/jats:italic>\n            , and its deadline by\n            <jats:italic>dj<\/jats:italic>\n            . In the discussion below, I have tried to point out interesting open problems wherever possible. Enjoy.\n          <\/jats:p>","DOI":"10.1145\/2421119.2421142","type":"journal-article","created":{"date-parts":[[2013,1,2]],"date-time":"2013-01-02T13:23:15Z","timestamp":1357132995000},"page":"123-129","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["SIGACT news online algorithms column 21"],"prefix":"10.1145","volume":"43","author":[{"given":"Rob","family":"van Stee","sequence":"first","affiliation":[{"name":"Max Planck Institute for Informatics, Saarbr\u00fccken, Germany"}]}],"member":"320","published-online":{"date-parts":[[2012,12,19]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_2_1_1_1","DOI":"10.1007\/978-3-642-33090-2_9"},{"doi-asserted-by":"publisher","key":"e_1_2_1_2_1","DOI":"10.1007\/978-3-642-33090-2_12"},{"volume-title":"Proc. 10th Workshop on Approximation and Online Algorithms (WAOA","year":"2012","author":"Balogh J\u00e1nos","key":"e_1_2_1_3_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_4_1","DOI":"10.1007\/11830924_6"},{"volume-title":"Gupta et al. {11}","author":"Chan Ho-Leung","first-page":"85","key":"e_1_2_1_5_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_6_1","DOI":"10.1109\/FOCS.2008.46"},{"key":"e_1_2_1_7_1","volume-title":"ESA 2012 - 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings","volume":"7501","author":"Epstein Leah","year":"2012"},{"volume-title":"Gupta et al. {11}","author":"Epstein Leah","first-page":"134","key":"e_1_2_1_8_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_9_1","DOI":"10.1016\/j.tcs.2010.04.042"},{"doi-asserted-by":"publisher","key":"e_1_2_1_10_1","DOI":"10.1016\/j.ipl.2012.01.015"},{"unstructured":"Anupam\n       \n      Gupta Klaus\n       \n      Jansen Jos\u00e9 D. P.\n       \n      Rolim and \n      \n      \n      Rocco A.\n       \n      Servedio editors\n      \n  \n  . \n  Approximation Randomization and Combinatorial Optimization. Algorithms and Techniques - 15th International Workshop APPROX\n   \n  2012 and 16th International Workshop RANDOM\n   2012 Cambridge MA USA August 15-17 2012. Proceedings volume \n  7408\n   of \n  Lecture Notes in Computer Science\n  . \n  Springer 2012.  Anupam Gupta Klaus Jansen Jos\u00e9 D. P. Rolim and Rocco A. Servedio editors. Approximation Randomization and Combinatorial Optimization. Algorithms and Techniques - 15th International Workshop APPROX 2012 and 16th International Workshop RANDOM 2012 Cambridge MA USA August 15-17 2012. Proceedings volume 7408 of Lecture Notes in Computer Science. Springer 2012.","key":"e_1_2_1_11_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_12_1","DOI":"10.1007\/s00170-009-2190-9"},{"doi-asserted-by":"publisher","key":"e_1_2_1_13_1","DOI":"10.1137\/S0097539702403438"},{"volume-title":"Proc. 10th Workshop on Approximation and Online Algorithms (WAOA","year":"2012","author":"Mtsubayashi Akira","key":"e_1_2_1_14_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_15_1","DOI":"10.1007\/978-3-642-33090-2_2"},{"doi-asserted-by":"publisher","key":"e_1_2_1_16_1","DOI":"10.1016\/0304-3975(94)90150-3"}],"container-title":["ACM SIGACT News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2421119.2421142","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2421119.2421142","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:18:34Z","timestamp":1750234714000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2421119.2421142"}},"subtitle":["APPROX and ALGO"],"short-title":[],"issued":{"date-parts":[[2012,12,19]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,12,19]]}},"alternative-id":["10.1145\/2421119.2421142"],"URL":"https:\/\/doi.org\/10.1145\/2421119.2421142","relation":{},"ISSN":["0163-5700"],"issn-type":[{"type":"print","value":"0163-5700"}],"subject":[],"published":{"date-parts":[[2012,12,19]]},"assertion":[{"value":"2012-12-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}