{"id":"https://openalex.org/W4395483938","doi":"https://doi.org/10.1145/3626183.3659971","title":"Hardness and Tight Approximations of Demand Strip Packing","display_name":"Hardness and Tight Approximations of Demand Strip Packing","publication_year":2024,"publication_date":"2024-06-04","ids":{"openalex":"https://openalex.org/W4395483938","doi":"https://doi.org/10.1145/3626183.3659971"},"language":"en","primary_location":{"id":"doi:10.1145/3626183.3659971","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3626183.3659971","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2404.15917","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5071305115","display_name":"Klaus Jansen","orcid":"https://orcid.org/0000-0001-8358-6796"},"institutions":[{"id":"https://openalex.org/I32021983","display_name":"Christian-Albrechts-Universit\u00e4t zu Kiel","ror":"https://ror.org/04v76ef78","country_code":"DE","type":"education","lineage":["https://openalex.org/I32021983"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Klaus Jansen","raw_affiliation_strings":["Kiel University, Kiel, Germany"],"raw_orcid":"https://orcid.org/0000-0001-8358-6796","affiliations":[{"raw_affiliation_string":"Kiel University, Kiel, Germany","institution_ids":["https://openalex.org/I32021983"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057430428","display_name":"Malin Rau","orcid":"https://orcid.org/0000-0002-5710-560X"},"institutions":[{"id":"https://openalex.org/I159176309","display_name":"Universit\u00e4t Hamburg","ror":"https://ror.org/00g30e956","country_code":"DE","type":"education","lineage":["https://openalex.org/I159176309"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Malin Rau","raw_affiliation_strings":["Hamburg University, Hamburg, Germany","University of Hamburg, Hamburg, Germany"],"raw_orcid":"https://orcid.org/0000-0002-5710-560X","affiliations":[{"raw_affiliation_string":"Hamburg University, Hamburg, Germany","institution_ids":["https://openalex.org/I159176309"]},{"raw_affiliation_string":"University of Hamburg, Hamburg, Germany","institution_ids":["https://openalex.org/I159176309"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060076035","display_name":"Malte Tutas","orcid":"https://orcid.org/0000-0002-1360-4634"},"institutions":[{"id":"https://openalex.org/I32021983","display_name":"Christian-Albrechts-Universit\u00e4t zu Kiel","ror":"https://ror.org/04v76ef78","country_code":"DE","type":"education","lineage":["https://openalex.org/I32021983"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Malte Tutas","raw_affiliation_strings":["Kiel University, Kiel, Germany"],"raw_orcid":"https://orcid.org/0000-0002-1360-4634","affiliations":[{"raw_affiliation_string":"Kiel University, Kiel, Germany","institution_ids":["https://openalex.org/I32021983"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7676,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.60911989,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"479","last_page":"489"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9939000010490417,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6984925270080566},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.613947868347168},{"id":"https://openalex.org/keywords/packing-problems","display_name":"Packing problems","score":0.5901871919631958},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.5818266272544861},{"id":"https://openalex.org/keywords/smart-grid","display_name":"Smart grid","score":0.532682478427887},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47809597849845886},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4764271676540375},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4476298391819},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.42903685569763184},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.42013904452323914},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4104793071746826},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39012160897254944},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38406264781951904},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.14058417081832886},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.12131699919700623}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6984925270080566},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.613947868347168},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.5901871919631958},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.5818266272544861},{"id":"https://openalex.org/C10558101","wikidata":"https://www.wikidata.org/wiki/Q689855","display_name":"Smart grid","level":2,"score":0.532682478427887},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47809597849845886},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4764271676540375},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4476298391819},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.42903685569763184},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.42013904452323914},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4104793071746826},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39012160897254944},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38406264781951904},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.14058417081832886},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.12131699919700623},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C119599485","wikidata":"https://www.wikidata.org/wiki/Q43035","display_name":"Electrical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3626183.3659971","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3626183.3659971","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2404.15917","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2404.15917","pdf_url":"https://arxiv.org/pdf/2404.15917","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2404.15917","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2404.15917","pdf_url":"https://arxiv.org/pdf/2404.15917","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4395483938.pdf"},"referenced_works_count":24,"referenced_works":["https://openalex.org/W1492611605","https://openalex.org/W1586863324","https://openalex.org/W1843208812","https://openalex.org/W1980685468","https://openalex.org/W1997959089","https://openalex.org/W2002506580","https://openalex.org/W2007927860","https://openalex.org/W2015301586","https://openalex.org/W2019318803","https://openalex.org/W2048462504","https://openalex.org/W2057913648","https://openalex.org/W2059422698","https://openalex.org/W2071027833","https://openalex.org/W2093979815","https://openalex.org/W2098666887","https://openalex.org/W2173475281","https://openalex.org/W2291270427","https://openalex.org/W2537875490","https://openalex.org/W2613758344","https://openalex.org/W2786984082","https://openalex.org/W2969583644","https://openalex.org/W4206057775","https://openalex.org/W4281744954","https://openalex.org/W4395483938"],"related_works":["https://openalex.org/W2368250618","https://openalex.org/W2810352541","https://openalex.org/W2970302286","https://openalex.org/W1815446007","https://openalex.org/W2783992526","https://openalex.org/W2142195909","https://openalex.org/W2962917430","https://openalex.org/W4299801389","https://openalex.org/W2574604093","https://openalex.org/W1903284337"],"abstract_inverted_index":{"We":[0,129],"settle":[1],"the":[2,6,27,33,36,40,79,150,179,236],"pseudo-polynomial":[3,88,208],"complexity":[4],"of":[5,15,21,38,66,81,152,164,184,218,229,238],"Demand":[7,132,169],"Strip":[8,133,170],"Packing":[9,134,171],"(DSP)":[10],"problem:":[11],"Given":[12],"a":[13,19,63,162,207],"strip":[14,34],"fixed":[16],"width":[17,181],"and":[18,25,126,154,172,241],"set":[20],"items":[22,28],"with":[23,35,214],"widths":[24],"heights,":[26],"must":[29],"be":[30],"placed":[31],"inside":[32],"objective":[37],"minimizing":[39],"peak":[41],"height.":[42],"This":[43],"problem":[44],"has":[45],"gained":[46],"significant":[47],"scientific":[48,121],"interest":[49,122],"due":[50],"to":[51,77,92,188,245],"its":[52],"relevance":[53],"in":[54,87,115,123],"smart":[55],"grids~[Deppert~et~al.":[56],"APPROX'21,":[57],"G\u00e1lvez~et~al.":[58],"APPROX'21].":[59],"Smart":[60],"Grids":[61],"are":[62,75,102,190,196,201],"modern":[64],"form":[65],"electrical":[67],"grid":[68],"that":[69,131,166],"provide":[70,108,146,206],"opportunities":[71],"for":[72,138,212],"optimization.":[73],"They":[74],"forecast":[76],"impact":[78],"future":[80],"energy":[82],"provision":[83],"significantly.":[84],"Algorithms":[85],"running":[86,114],"time":[89,97,209],"lend":[90],"themselves":[91],"these":[93,158],"applications":[94],"as":[95,100,192],"considered":[96],"intervals,":[98],"such":[99,105],"days,":[101],"small.":[103],"Moreover,":[104],"algorithms":[106],"can":[107],"superior":[109],"approximation":[110,139,210,216],"guarantees":[111],"over":[112],"those":[113],"polynomial":[116],"time.":[117],"Consequently,":[118],"they":[119],"evoke":[120],"related":[124],"problems~[Jansen":[125],"Rau":[127],"ESA'19].":[128],"prove":[130],"is":[135,221],"strongly":[136],"NP-hard":[137],"ratios":[140],"below~5/4.":[141],"Through":[142],"this":[143,230],"proof,":[144],"we":[145,160,205],"novel":[147,243],"insights":[148,234],"into":[149,235],"relation":[151],"packing":[153],"scheduling":[155],"problems.":[156],"Using":[157],"insights,":[159],"show":[161],"series":[163],"frameworks":[165],"solve":[167],"both":[168],"Parallel":[173],"Task":[174],"Scheduling":[175],"optimally":[176],"when":[177,198],"increasing":[178],"strip's":[180],"or":[182],"number":[183],"machines.":[185],"Such":[186],"alterations":[187],"problems":[189],"known":[191],"resource":[193],"augmentation.":[194],"Applications":[195],"found":[197],"penalty":[199],"costs":[200],"prohibitively":[202],"large.":[203],"Finally,":[204],"algorithm":[211,231],"DSP":[213,239],"an":[215],"ratio":[217],"(5/4+\u03b5),":[219],"which":[220],"nearly":[222],"optimal":[223,247],"assuming":[224],"P\u2260neq":[225],"NP.":[226],"The":[227],"construction":[228],"provides":[232],"several":[233],"structure":[237],"solutions":[240],"uses":[242],"techniques":[244],"restructure":[246],"solutions.":[248]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}