{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:33:16Z","timestamp":1750221196328,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,11]],"date-time":"2018-07-11T00:00:00Z","timestamp":1531267200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1445755"],"award-info":[{"award-number":["CCF-1445755"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,7,11]]},"DOI":"10.1145\/3210377.3210666","type":"proceedings-article","created":{"date-parts":[[2018,7,12]],"date-time":"2018-07-12T17:46:44Z","timestamp":1531417604000},"page":"343-345","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Brief Announcement"],"prefix":"10.1145","author":[{"given":"Kanthi","family":"Sarpatwar","sequence":"first","affiliation":[{"name":"IBM T.J. Watson Research Center, Yorktown Heights, NY, USA"}]},{"given":"Baruch","family":"Schieber","sequence":"additional","affiliation":[{"name":"IBM T.J. Watson Research Center, Yorktown Heights, NY, USA"}]},{"given":"Hadas","family":"Shachnai","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}]}],"member":"320","published-online":{"date-parts":[[2018,7,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1002\/jos.74"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1957995.1957998"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/2884435.2884541"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2532645"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/502102.502107"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539799354138"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2000807.2000816"},{"volume-title":"Improved algorithms for resource allocation under varying capacity Proceedings of the 22nd Annual European Symposium on Algorithms","author":"Chakaravarthy Venkatesan T","key":"e_1_3_2_1_8_1","unstructured":"Venkatesan T Chakaravarthy , Anamitra R Choudhury , Shalmoli Gupta , Sambuddha Roy , and Yogish Sabharwal . 2014. Improved algorithms for resource allocation under varying capacity Proceedings of the 22nd Annual European Symposium on Algorithms . Springer , 222--234. Venkatesan T Chakaravarthy, Anamitra R Choudhury, Shalmoli Gupta, Sambuddha Roy, and Yogish Sabharwal . 2014. Improved algorithms for resource allocation under varying capacity Proceedings of the 22nd Annual European Symposium on Algorithms. Springer, 222--234."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539799356265"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1080\/07408170208928886"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03685-9_6"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.38"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1024060710627"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-005-5217-6"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1110.0499"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/2627817.2627827"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:JOSH.0000036860.90818.5f"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2742343"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/645591.660084"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1128"},{"key":"e_1_3_2_1_21_1","volume-title":"International Journal of System Assurance Engineering and Management","author":"Kaul Arshia","year":"2017","unstructured":"Arshia Kaul , Sugandha Aggarwal , Anshu Gupta , Niraj Dayama , Mohan Krishnamoorthy , and PC Jha . 2017. Optimal advertising on a two-dimensional web banner . International Journal of System Assurance Engineering and Management ( 2017 ), 1--6. Arshia Kaul, Sugandha Aggarwal, Anshu Gupta, Niraj Dayama, Mohan Krishnamoorthy, and PC Jha . 2017. Optimal advertising on a two-dimensional web banner. International Journal of System Assurance Engineering and Management (2017), 1--6."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.190640"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02248588"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1287\/inte.2017.0886"},{"volume-title":"Off-line admission control for general scheduling problems Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms. 879--888","author":"Phillips Cynthia A.","key":"e_1_3_2_1_25_1","unstructured":"Cynthia A. Phillips , R. N. Uma , and Joel Wein . 2000. Off-line admission control for general scheduling problems Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms. 879--888 . Cynthia A. Phillips, R. N. Uma, and Joel Wein . 2000. Off-line admission control for general scheduling problems Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms. 879--888."}],"event":{"name":"SPAA '18: 30th ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"],"location":"Vienna Austria","acronym":"SPAA '18"},"container-title":["Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3210377.3210666","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3210377.3210666","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3210377.3210666","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:39:20Z","timestamp":1750210760000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3210377.3210666"}},"subtitle":["Approximation Algorithms for Preemptive Resource Allocation"],"short-title":[],"issued":{"date-parts":[[2018,7,11]]},"references-count":25,"alternative-id":["10.1145\/3210377.3210666","10.1145\/3210377"],"URL":"https:\/\/doi.org\/10.1145\/3210377.3210666","relation":{},"subject":[],"published":{"date-parts":[[2018,7,11]]},"assertion":[{"value":"2018-07-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}