{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:42:18Z","timestamp":1750308138884,"version":"3.41.0"},"reference-count":75,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2006,3,1]],"date-time":"2006-03-01T00:00:00Z","timestamp":1141171200000},"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":[[2006,3]]},"abstract":"<jats:p>This quarter's column contains a survey of work on online algorithms from last year. It covers papers from the following conferences: SODA, STACS, STOC, ICALP, ESA, WADS, COCOON, ISAAC, FCT, FOCS and MFCS. The bibliography of online algorithms (see www.cs.ucr.edu\/~marek\/pubs\/online.bib) has been updated, and it now contains all the papers discussed in this survey -- and more.<\/jats:p>","DOI":"10.1145\/1122480.1122499","type":"journal-article","created":{"date-parts":[[2006,5,8]],"date-time":"2006-05-08T22:51:53Z","timestamp":1147128713000},"page":"82-98","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["2005"],"prefix":"10.1145","volume":"37","author":[{"given":"Marek","family":"Chrobak","sequence":"first","affiliation":[{"name":"University of California, Riverside"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2006,3]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060682"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007366"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704446268"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/2958119.2958160"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780558"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/2958119.2958144"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.2307\/1907353"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/258128.258201"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/11534273_27"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060599"},{"key":"e_1_2_1_11_1","first-page":"32","volume-title":"Proc. 34th Symp. Foundations of Computer Science (FOCS)","author":"Awerbuch Baruch","year":"1993","unstructured":"Baruch Awerbuch , Yossi Azar , and Serge Plotkin . Throughput-competitive online routing . In Proc. 34th Symp. Foundations of Computer Science (FOCS) , pages 32 -- 40 . IEEE, 1993 . Baruch Awerbuch, Yossi Azar, and Serge Plotkin. Throughput-competitive online routing. In Proc. 34th Symp. Foundations of Computer Science (FOCS), pages 32--40. IEEE, 1993."},{"key":"e_1_2_1_12_1","first-page":"197","volume-title":"Proc. 16th Symp. on Discrete Algorithms (SODA)","author":"Awerbuch Baruch","year":"2005","unstructured":"Baruch Awerbuch , Mohammad Taghi Hajiaghayi , Robert D. Kleinberg , and Tom Leighton . Online client-server load balancing without global information . In Proc. 16th Symp. on Discrete Algorithms (SODA) , pages 197 -- 206 , 2005 . Baruch Awerbuch, Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, and Tom Leighton. Online client-server load balancing without global information. In Proc. 16th Symp. on Discrete Algorithms (SODA), pages 197--206, 2005."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561071_44"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/2958119.2958219"},{"key":"e_1_2_1_15_1","first-page":"215","volume-title":"Proc. 16th Symp. on Discrete Algorithms (SODA)","author":"Bansal Nikhil","year":"2005","unstructured":"Nikhil Bansal , Moses Charikar , Sanjeev Khanna , and Joseph Naor . Approximating the average response time in broadcast scheduling . In Proc. 16th Symp. on Discrete Algorithms (SODA) , pages 215 -- 221 , 2005 . Nikhil Bansal, Moses Charikar, Sanjeev Khanna, and Joseph Naor. Approximating the average response time in broadcast scheduling. In Proc. 16th Symp. on Discrete Algorithms (SODA), pages 215--221, 2005."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.24"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31856-9_38"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/11537311_25"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/11534273_32"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/11534273_11"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/11549345_1"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31856-9_30"},{"key":"e_1_2_1_23_1","first-page":"1156","volume-title":"Proc. 16th Symp. on Discrete Algorithms (SODA)","author":"Blum Avrim","year":"2005","unstructured":"Avrim Blum and Jason D. Hartline . Near-optimal online auctions . In Proc. 16th Symp. on Discrete Algorithms (SODA) , pages 1156 -- 1163 , 2005 . Avrim Blum and Jason D. Hartline. Near-optimal online auctions. In Proc. 16th Symp. on Discrete Algorithms (SODA), pages 1156--1163, 2005."},{"key":"e_1_2_1_24_1","volume-title":"Proc. 14th Symp. on Discrete Algorithms (SODA)","author":"Blum Avrim","year":"2003","unstructured":"Avrim Blum , Vijay Kumar , Atri Rudra , and Felix Wu . Online learning in online auctions . In Proc. 14th Symp. on Discrete Algorithms (SODA) , 2003 . Avrim Blum, Vijay Kumar, Atri Rudra, and Felix Wu. Online learning in online auctions. In Proc. 14th Symp. on Discrete Algorithms (SODA), 2003."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/11537311_35"},{"key":"e_1_2_1_26_1","first-page":"718","volume-title":"Proc. 16th Symp. on Discrete Algorithms (SODA)","author":"Boyar Joan","year":"2005","unstructured":"Joan Boyar , Lene M. Favrholdt , and Kim S. Larsen . The relative worst order ratio applied to paging . In Proc. 16th Symp. on Discrete Algorithms (SODA) , pages 718 -- 727 , 2005 . Joan Boyar, Lene M. Favrholdt, and Kim S. Larsen. The relative worst order ratio applied to paging. In Proc. 16th Symp. on Discrete Algorithms (SODA), pages 718--727, 2005."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561071_61"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/11549345_21"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_50"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(95)00039-9"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561071_8"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060600"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30140-0_20"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/11533719_66"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1137\/0212014"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/11602613_44"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24749-4_18"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_51"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561071_54"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_49"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/11549345_26"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(99)00062-0"},{"key":"e_1_2_1_43_1","first-page":"545","volume-title":"Proc. 16th Symp. on Discrete Algorithms (SODA)","author":"Fiat Amos","year":"2005","unstructured":"Amos Fiat , Meital Levy , Jir\u00ed Matousek , Elchanan Mossel , J\u00e1nos Pach , Micha Sharir , Shakhar Smorodinsky , Uli Wagner , and Emo Welzl . Online conflict-free coloring for intervals . In Proc. 16th Symp. on Discrete Algorithms (SODA) , pages 545 -- 554 , 2005 . Amos Fiat, Meital Levy, Jir\u00ed Matousek, Elchanan Mossel, J\u00e1nos Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner, and Emo Welzl. Online conflict-free coloring for intervals. In Proc. 16th Symp. on Discrete Algorithms (SODA), pages 545--554, 2005."},{"key":"e_1_2_1_44_1","first-page":"385","volume-title":"Proc. 16th Symp. on Discrete Algorithms (SODA)","author":"Flaxman Abraham","year":"2005","unstructured":"Abraham Flaxman , Adam Tauman Kalai , and H. Brendan McMahan . Online convex optimization in the bandit setting: gradient descent without a gradient . In Proc. 16th Symp. on Discrete Algorithms (SODA) , pages 385 -- 394 , 2005 . Abraham Flaxman, Adam Tauman Kalai, and H. Brendan McMahan. Online convex optimization in the bandit setting: gradient descent without a gradient. In Proc. 16th Symp. on Discrete Algorithms (SODA), pages 385--394, 2005."},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561071_67"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.5555\/645413.652158"},{"key":"e_1_2_1_47_1","first-page":"1164","volume-title":"Proc. 16th Symp. on Discrete Algorithms (SODA)","author":"Guruswami Venkatesan","year":"2005","unstructured":"Venkatesan Guruswami , Jason D. Hartline , Anna R. Karlin , David Kempe , Claire Kenyon , and Frank McSherry . On profit-maximizing envy-free pricing . In Proc. 16th Symp. on Discrete Algorithms (SODA) , pages 1164 -- 1173 , 2005 . Venkatesan Guruswami, Jason D. Hartline, Anna R. Karlin, David Kempe, Claire Kenyon, and Frank McSherry. On profit-maximizing envy-free pricing. In Proc. 16th Symp. on Discrete Algorithms (SODA), pages 1164--1173, 2005."},{"key":"e_1_2_1_48_1","first-page":"782","volume-title":"Proc. 16th Symp. on Discrete Algorithms (SODA)","author":"Hajiaghayi Mohammad Taghi","year":"2005","unstructured":"Mohammad Taghi Hajiaghayi , Robert D. Kleinberg , Tom Leighton , and Harald R\u00e4cke . Oblivious routing on node-capacitated and directed graphs . In Proc. 16th Symp. on Discrete Algorithms (SODA) , pages 782 -- 790 , 2005 . Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton, and Harald R\u00e4cke. Oblivious routing on node-capacitated and directed graphs. In Proc. 16th Symp. on Discrete Algorithms (SODA), pages 782--790, 2005."},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/988772.988784"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/777792.777810"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1007\/11602613_43"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-001-0125-4"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00140-1"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1002\/jos.87"},{"key":"e_1_2_1_55_1","first-page":"630","volume-title":"Proc. 16th Symp. on Discrete Algorithms (SODA)","author":"Kleinberg Robert D.","year":"2005","unstructured":"Robert D. Kleinberg . A multiple-choice secretary algorithm with applications to online auctions . In Proc. 16th Symp. on Discrete Algorithms (SODA) , pages 630 -- 631 , 2005 . Robert D. Kleinberg. A multiple-choice secretary algorithm with applications to online auctions. In Proc. 16th Symp. on Discrete Algorithms (SODA), pages 630--631, 2005."},{"key":"e_1_2_1_56_1","series-title":"Lecture Notes in. Comput. Sci.","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1007\/3-540-49116-3_38","volume-title":"Proc. 16th Symp. on Theoretical Aspects of Computer Science (STACS)","author":"Koutsoupias Elias","year":"1999","unstructured":"Elias Koutsoupias and Christos Papadimitriou . Worst-case equilibria . In Proc. 16th Symp. on Theoretical Aspects of Computer Science (STACS) , Lecture Notes in. Comput. Sci. , pages 404 -- 413 . Springer , 1999 . Elias Koutsoupias and Christos Papadimitriou. Worst-case equilibria. In Proc. 16th Symp. on Theoretical Aspects of Computer Science (STACS), Lecture Notes in. Comput. Sci., pages 404--413. Springer, 1999."},{"key":"e_1_2_1_57_1","first-page":"1146","volume-title":"Proc. 16th Symp. on Discrete Algorithms (SODA)","author":"Lavi Ron","year":"2005","unstructured":"Ron Lavi and Noam Nisan . Online ascending auctions for gradually expiring items . In Proc. 16th Symp. on Discrete Algorithms (SODA) , pages 1146 -- 1155 , 2005 . Ron Lavi and Noam Nisan. Online ascending auctions for gradually expiring items. In Proc. 16th Symp. on Discrete Algorithms (SODA), pages 1146--1155, 2005."},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/3828.3833"},{"key":"e_1_2_1_59_1","first-page":"801","volume-title":"Proc. 16th Symp. on Discrete Algorithms (SODA)","author":"Li Fei","year":"2005","unstructured":"Fei Li , Jay Sethuraman , and Clifford Stein . An optimal online algorithm for packet scheduling with agreeable deadlines . In Proc. 16th Symp. on Discrete Algorithms (SODA) , pages 801 -- 802 , 2005 . Fei Li, Jay Sethuraman, and Clifford Stein. An optimal online algorithm for packet scheduling with agreeable deadlines. In Proc. 16th Symp. on Discrete Algorithms (SODA), pages 801--802, 2005."},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.12"},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701383443"},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.72"},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561071_60"},{"key":"e_1_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27798-9_36"},{"key":"e_1_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.5555\/645413.652152"},{"key":"e_1_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.5555\/647912.740811"},{"key":"e_1_2_1_67_1","first-page":"791","volume-title":"Proc. 16th Symp. on Discrete Algorithms (SODA)","author":"R\u00e4cke Harald","year":"2005","unstructured":"Harald R\u00e4cke and Adi Ros\u00e9n . Distributed online call control on general networks . In Proc. 16th Symp. on Discrete Algorithms (SODA) , pages 791 -- 800 , 2005 . Harald R\u00e4cke and Adi Ros\u00e9n. Distributed online call control on general networks. In Proc. 16th Symp. on Discrete Algorithms (SODA), pages 791--800, 2005."},{"key":"e_1_2_1_68_1","volume-title":"Selfish routing and the price of anarchy","author":"Roughgarden Tim","year":"2005","unstructured":"Tim Roughgarden . Selfish routing and the price of anarchy . The MIT Press , 2005 . Tim Roughgarden. Selfish routing and the price of anarchy. The MIT Press, 2005."},{"key":"e_1_2_1_69_1","first-page":"1184","volume-title":"Proc. 16th Symp. on Discrete Algorithms (SODA)","author":"Roughgarden Tim","year":"2005","unstructured":"Tim Roughgarden . Selfish routing with atomic players . In Proc. 16th Symp. on Discrete Algorithms (SODA) , pages 1184 -- 1185 , 2005 . Tim Roughgarden. Selfish routing with atomic players. In Proc. 16th Symp. on Discrete Algorithms (SODA), pages 1184--1185, 2005."},{"key":"e_1_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/506147.506153"},{"key":"e_1_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561071_5"},{"key":"e_1_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31856-9_24"},{"key":"e_1_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.5555\/2958119.2958218"},{"key":"e_1_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.5555\/795662.796264"},{"key":"e_1_2_1_75_1","first-page":"928","volume-title":"Proc. 12th Int. Conference on Machine Learning","author":"Zinkevich M.","year":"2003","unstructured":"M. Zinkevich . Online convex programming and generalized infinitesimal gradient ascent . In Proc. 12th Int. Conference on Machine Learning , pages 928 -- 936 , 2003 . M. Zinkevich. Online convex programming and generalized infinitesimal gradient ascent. In Proc. 12th Int. Conference on Machine Learning, pages 928--936, 2003."}],"container-title":["ACM SIGACT News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1122480.1122499","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1122480.1122499","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:08:37Z","timestamp":1750262917000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1122480.1122499"}},"subtitle":["an offline persepctive"],"short-title":[],"issued":{"date-parts":[[2006,3]]},"references-count":75,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,3]]}},"alternative-id":["10.1145\/1122480.1122499"],"URL":"https:\/\/doi.org\/10.1145\/1122480.1122499","relation":{},"ISSN":["0163-5700"],"issn-type":[{"type":"print","value":"0163-5700"}],"subject":[],"published":{"date-parts":[[2006,3]]},"assertion":[{"value":"2006-03-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}