{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:39:35Z","timestamp":1750307975354,"version":"3.41.0"},"reference-count":13,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2007,9,1]],"date-time":"2007-09-01T00:00:00Z","timestamp":1188604800000},"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":[[2007,9]]},"abstract":"<jats:p>\n            <jats:bold>From the editor:<\/jats:bold>\n            So you are reading this paper on online algorithms. At first the paper reads well, and you get through the first few pages in no time -- until the authors pull a rabbit out of a hat: the online algorithm. Fine, you say to yourself, patience, it all will start making sense when I get to the analysis, just keep reading. But it doesn't -- the proof is by an even more mysterious trick, and this time out of the hat comes a humpback whale: yes, a potential function. Sound familiar?\n          <\/jats:p>","DOI":"10.1145\/1324215.1324233","type":"journal-article","created":{"date-parts":[[2007,12,7]],"date-time":"2007-12-07T19:19:01Z","timestamp":1197055141000},"page":"100-105","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Competitiveness via primal-dual"],"prefix":"10.1145","volume":"38","author":[{"given":"Marek","family":"Chrobak","sequence":"first","affiliation":[{"name":"University of California, Riverside"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,9]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780558"},{"key":"e_1_2_1_2_1","first-page":"577","volume-title":"Proc. 15th Symp. on Discrete Algorithms (SODA)","author":"Alon N.","year":"2004","unstructured":"N. Alon , B. Awerbuch , Y. Azar , N. Buchbinder , and J. Naor . A general approach to online network optimization problems . In Proc. 15th Symp. on Discrete Algorithms (SODA) , pages 577 -- 586 . ACM\/SIAM, 2004 . N. Alon, B. Awerbuch, Y. Azar, N. Buchbinder, and J. Naor. A general approach to online network optimization problems. In Proc. 15th Symp. on Discrete Algorithms (SODA), pages 577--586. ACM\/SIAM, 2004."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/146585.146588"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1778580.1778606"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561071_61"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.39"},{"key":"e_1_2_1_7_1","volume-title":"Proceedings of the 1997 Usenix Symposium on Internet Technologies and Systems (USITS-97)","author":"Cao P.","year":"1997","unstructured":"P. Cao and S. Irani . Cost-aware WWW proxy caching algorithms . In Proceedings of the 1997 Usenix Symposium on Internet Technologies and Systems (USITS-97) , Monterey, CA , 1997 . P. Cao and S. Irani. Cost-aware WWW proxy caching algorithms. In Proceedings of the 1997 Usenix Symposium on Internet Technologies and Systems (USITS-97), Monterey, CA, 1997."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/0404017"},{"key":"e_1_2_1_9_1","series-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1090\/dimacs\/007\/02","volume-title":"On-line Algorithms","author":"Chrobak M.","year":"1992","unstructured":"M. Chrobak and L. L. Larmore . The server problem and on-line games . In L. A. McGeoch and D. D. Sleator, editors, On-line Algorithms , volume 7 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science , pages 11 -- 64 . AMS\/ACM , 1992 . M. Chrobak and L. L. Larmore. The server problem and on-line games. In L. A. McGeoch and D. D. Sleator, editors, On-line Algorithms, volume 7 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 11--64. AMS\/ACM, 1992."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(90)90003-W"},{"key":"e_1_2_1_11_1","volume-title":"Approximation Algorithms","author":"Vazirani V.","year":"2001","unstructured":"V. Vazirani . Approximation Algorithms . Springer , 2001 . V. Vazirani. Approximation Algorithms. Springer, 2001."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01189992"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-001-0124-5"}],"container-title":["ACM SIGACT News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1324215.1324233","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1324215.1324233","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:58:25Z","timestamp":1750258705000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1324215.1324233"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,9]]}},"alternative-id":["10.1145\/1324215.1324233"],"URL":"https:\/\/doi.org\/10.1145\/1324215.1324233","relation":{},"ISSN":["0163-5700"],"issn-type":[{"type":"print","value":"0163-5700"}],"subject":[],"published":{"date-parts":[[2007,9]]},"assertion":[{"value":"2007-09-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}