{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T16:40:05Z","timestamp":1755880805237,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T00:00:00Z","timestamp":1718582400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"DFG","award":["JA 612\/25-1 and FOR 2975: 411362735"],"award-info":[{"award-number":["JA 612\/25-1 and FOR 2975: 411362735"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,17]]},"DOI":"10.1145\/3626183.3659971","type":"proceedings-article","created":{"date-parts":[[2024,6,4]],"date-time":"2024-06-04T18:23:04Z","timestamp":1717525384000},"page":"479-489","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Hardness and Tight Approximations of Demand Strip Packing"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8358-6796","authenticated-orcid":false,"given":"Klaus","family":"Jansen","sequence":"first","affiliation":[{"name":"Kiel University, Kiel, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5710-560X","authenticated-orcid":false,"given":"Malin","family":"Rau","sequence":"additional","affiliation":[{"name":"Hamburg University, Hamburg, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1360-4634","authenticated-orcid":false,"given":"Malte","family":"Tutas","sequence":"additional","affiliation":[{"name":"Kiel University, Kiel, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,6,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/0209064"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-015-0427-z"},{"key":"e_1_3_2_1_3_1","first-page":"1","article-title":"Peak Demand Minimization via Sliced Strip Packing. In APPROX-RANDOM (LIPIcs, Vol. 207)","volume":"21","author":"Deppert Max A.","year":"2021","unstructured":"Max A. Deppert, Klaus Jansen, Arindam Khan, Malin Rau, and Malte Tutas. 2021. Peak Demand Minimization via Sliced Strip Packing. In APPROX-RANDOM (LIPIcs, Vol. 207). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 21:1--21:24.","journal-title":"Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.renene.2019.08.092"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/0402042"},{"key":"e_1_3_2_1_6_1","volume-title":"Afrouz Jabal Ameli, and Kamyar Khodamoradi","author":"G\u00e1lvez Waldo","year":"2021","unstructured":"Waldo G\u00e1lvez, Fabrizio Grandoni, Afrouz Jabal Ameli, and Kamyar Khodamoradi. 2021. Approximation Algorithms for Demand Strip Packing. CoRR, Vol. abs\/2105.08577 (2021)."},{"key":"e_1_3_2_1_7_1","first-page":"1","article-title":"Improved Pseudo-Polynomial-Time Approximation for Strip Packing. In FSTTCS (LIPIcs, Vol. 65)","volume":"9","author":"G\u00e1lvez Waldo","year":"2016","unstructured":"Waldo G\u00e1lvez, Fabrizio Grandoni, Salvatore Ingala, and Arindam Khan. 2016. Improved Pseudo-Polynomial-Time Approximation for Strip Packing. In FSTTCS (LIPIcs, Vol. 65). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 9:1--9:14.","journal-title":"Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Fabrizio Grandoni Tobias M\u00f6mke and Andreas Wiese. 2022a. A PTAS for unsplittable flow on a path. In STOC. ACM 289--302.","DOI":"10.1145\/3519935.3519959"},{"volume-title":"Unsplittable Flow on a Path: The Game!","author":"Grandoni Fabrizio","key":"e_1_3_2_1_9_1","unstructured":"Fabrizio Grandoni, Tobias M\u00f6mke, and Andreas Wiese. 2022b. Unsplittable Flow on a Path: The Game!. In SODA. SIAM, 906--926."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2013.08.008"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03685-9_14"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-90530-3_15"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/7531.7535"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-53925-6_32"},{"key":"e_1_3_2_1_15_1","first-page":"1","article-title":"Closing the Gap for Pseudo-Polynomial Strip Packing. In ESA (LIPIcs, Vol. 144)","volume":"62","author":"Jansen Klaus","year":"2019","unstructured":"Klaus Jansen and Malin Rau. 2019. Closing the Gap for Pseudo-Polynomial Strip Packing. In ESA (LIPIcs, Vol. 144). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 62:1--62:14.","journal-title":"Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Klaus Jansen Malin Rau and Malte Tutas. 2024. Hardness and Tight Approximation of Demand Strip Packing. arxiv: 2404.15917 [cs.DS]","DOI":"10.1145\/3626183.3659971"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/080736491"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/0209062"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Landis D. Kannberg David P. Chassin John G. DeSteese Steve G. Hauser Michael C. Kintner-Meyer Robert G. Pratt Lawrence A. Schienbein and W. Michael Warwick. 2003. GridWiseTM: The Benefits of a Transformed Energy System. Technical Report. Pacific Northwest National Laboratory.","DOI":"10.2172\/15010370"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830918500258"},{"key":"e_1_3_2_1_21_1","first-page":"1","article-title":"Breaking the Barrier of 2 for the Storage Allocation Problem. In ICALP (LIPIcs, Vol. 168)","volume":"86","author":"M\u00f6mke Tobias","year":"2020","unstructured":"Tobias M\u00f6mke and Andreas Wiese. 2020. Breaking the Barrier of 2 for the Storage Allocation Problem. In ICALP (LIPIcs, Vol. 168). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 86:1--86:19.","journal-title":"Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik"},{"volume-title":"On approximating strip packing with a better ratio than 3\/2","author":"Nadiradze Giorgi","key":"e_1_3_2_1_22_1","unstructured":"Giorgi Nadiradze and Andreas Wiese. 2016. On approximating strip packing with a better ratio than 3\/2. In SODA. SIAM, 1491--1510."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCC.2014.6912525"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCC.2015.7405605"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0049416"},{"key":"e_1_3_2_1_26_1","volume-title":"Demand response and smart grids-A survey. Renewable and sustainable energy reviews","author":"Siano Pierluigi","year":"2014","unstructured":"Pierluigi Siano. 2014. Demand response and smart grids-A survey. Renewable and sustainable energy reviews, Vol. 30 (2014), 461--478."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(80)90121-0"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793255801"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2013.6566904"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2013.6566904"},{"volume-title":"Peak Energy Demand and Demand Side Response","author":"Torriti Jacopo","key":"e_1_3_2_1_31_1","unstructured":"Jacopo Torriti. 2016. Peak Energy Demand and Demand Side Response. Routledge."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/SmartGridComm.2014.7007741"}],"event":{"name":"SPAA '24: 36th 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":"Nantes France","acronym":"SPAA '24"},"container-title":["Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3626183.3659971","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3626183.3659971","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T16:24:12Z","timestamp":1755879852000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3626183.3659971"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,17]]},"references-count":32,"alternative-id":["10.1145\/3626183.3659971","10.1145\/3626183"],"URL":"https:\/\/doi.org\/10.1145\/3626183.3659971","relation":{},"subject":[],"published":{"date-parts":[[2024,6,17]]},"assertion":[{"value":"2024-06-17","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}