{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T17:54:19Z","timestamp":1777398859802,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,1]],"date-time":"2013-06-01T00:00:00Z","timestamp":1370044800000},"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":[],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1145\/2488608.2488674","type":"proceedings-article","created":{"date-parts":[[2013,5,28]],"date-time":"2013-05-28T16:35:41Z","timestamp":1369758941000},"page":"525-534","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["The power of deferral"],"prefix":"10.1145","author":[{"given":"Albert","family":"Gu","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anupam","family":"Gupta","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amit","family":"Kumar","sequence":"additional","affiliation":[{"name":"IIT Delhi, New Delhi, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,6]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792236237"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02573969"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009263"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02927-1_11"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.05.021"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1662"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258618"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000024"},{"key":"e_1_3_2_1_9_1","series-title":"Lecture Notes in Comput","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1007\/978-3-642-23719-5_48","volume-title":"ESA","author":"Epstein L.","year":"2011","unstructured":"L. Epstein and A. Levin . Robust algorithms for preemptive scheduling . In ESA , volume 6942 of Lecture Notes in Comput . Sci., pages 567 -- 578 . Springer , Heidelberg, 2011 . L. Epstein and A. Levin. Robust algorithms for preemptive scheduling. In ESA, volume 6942 of Lecture Notes in Comput. Sci., pages 567--578. Springer, Heidelberg, 2011."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793242618"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/0404033"},{"key":"e_1_3_2_1_12_1","first-page":"751","volume-title":"Allerton","author":"Kirsch A.","year":"2007","unstructured":"A. Kirsch and M. Mitzenmacher . Using a queue to de-amortize cuckoo hashing in hardware . In Allerton , pages 751 -- 758 , 2007 . A. Kirsch and M. Mitzenmacher. Using a queue to de-amortize cuckoo hashing in hardware. In Allerton, pages 751--758, 2007."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31594-7_58"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1090.0381"},{"key":"e_1_3_2_1_15_1","series-title":"LNCS","first-page":"36","volume-title":"ESA (I)","author":"Skutella M.","year":"2010","unstructured":"M. Skutella and J. Verschae . A robust PTAS for machine covering and packing . In ESA (I) , volume 6346 of LNCS , pages 36 -- 47 . Springer , Berlin , 2010 . M. Skutella and J. Verschae. A robust PTAS for machine covering and packing. In ESA (I), volume 6346 of LNCS, pages 36--47. Springer, Berlin, 2010."},{"key":"e_1_3_2_1_16_1","first-page":"379","volume-title":"ICALP (1)","author":"Varadaraja A. B.","year":"2011","unstructured":"A. B. Varadaraja . Buyback problem - approximate matroid intersection with cancellation costs. In ICALP (1) , pages 379 -- 390 , 2011 . A. B. Varadaraja. Buyback problem - approximate matroid intersection with cancellation costs. In ICALP (1), pages 379--390, 2011."},{"key":"e_1_3_2_1_17_1","volume-title":"Approximation algorithms","author":"Vazirani V. V.","year":"2001","unstructured":"V. V. Vazirani . Approximation algorithms . Springer-Verlag , Berlin , 2001 . V. V. Vazirani. Approximation algorithms. Springer-Verlag, Berlin, 2001."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1074"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/1971947"}],"event":{"name":"STOC'13: Symposium on Theory of Computing","location":"Palo Alto California USA","acronym":"STOC'13","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-fifth annual ACM symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2488608.2488674","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2488608.2488674","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:20Z","timestamp":1750235960000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2488608.2488674"}},"subtitle":["maintaining a constant-competitive steiner tree online"],"short-title":[],"issued":{"date-parts":[[2013,6]]},"references-count":19,"alternative-id":["10.1145\/2488608.2488674","10.1145\/2488608"],"URL":"https:\/\/doi.org\/10.1145\/2488608.2488674","relation":{},"subject":[],"published":{"date-parts":[[2013,6]]},"assertion":[{"value":"2013-06-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}