{"id":"https://openalex.org/W7164036578","doi":"https://doi.org/10.1145/3798129.3800913","title":"Tight (S)ETH-Based Lower Bounds for Pseudopolynomial Algorithms for Bin Packing and Multi-machine Scheduling","display_name":"Tight (S)ETH-Based Lower Bounds for Pseudopolynomial Algorithms for Bin Packing and Multi-machine Scheduling","publication_year":2026,"publication_date":"2026-06-09","ids":{"openalex":"https://openalex.org/W7164036578","doi":"https://doi.org/10.1145/3798129.3800913"},"language":null,"primary_location":{"id":"doi:10.1145/3798129.3800913","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800913","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3798129.3800913","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5044394587","display_name":"Karl Bringmann","orcid":"https://orcid.org/0000-0003-1356-5177"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Karl Bringmann","raw_affiliation_strings":["ETH Z\u00fcrich, Z\u00fcrich, Switzerland"],"raw_orcid":"https://orcid.org/0000-0003-1356-5177","affiliations":[{"raw_affiliation_string":"ETH Z\u00fcrich, Z\u00fcrich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078483534","display_name":"Anita D\u00fcrr","orcid":"https://orcid.org/0000-0003-0440-5008"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Anita D\u00fcrr","raw_affiliation_strings":["ETH Z\u00fcrich, Z\u00fcrich, Switzerland"],"raw_orcid":"https://orcid.org/0000-0003-0440-5008","affiliations":[{"raw_affiliation_string":"ETH Z\u00fcrich, Z\u00fcrich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055238529","display_name":"Karol W\u0119grzycki","orcid":"https://orcid.org/0000-0001-9746-5733"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Karol W\u0119grzycki","raw_affiliation_strings":["MPI-INF, Saarbr\u00fccken, Germany"],"raw_orcid":"https://orcid.org/0000-0001-9746-5733","affiliations":[{"raw_affiliation_string":"MPI-INF, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.93734336,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"2094","last_page":"2105"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9807999730110168,"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.9807999730110168,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0032999999821186066,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.0017000000225380063,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5569999814033508},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.42829999327659607},{"id":"https://openalex.org/keywords/bin-packing-problem","display_name":"Bin packing problem","score":0.36320000886917114},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.35269999504089355},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.3012000024318695}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6607000231742859},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6485999822616577},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5569999814033508},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.42829999327659607},{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.36320000886917114},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.35269999504089355},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30300000309944153},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.3012000024318695},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.29829999804496765},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2890999913215637},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.28290000557899475},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2791999876499176},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.25920000672340393},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.25690001249313354}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3798129.3800913","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800913","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3798129.3800913","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800913","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2112429806","display_name":null,"funder_award_id":"559177164","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G2410103071","display_name":null,"funder_award_id":"850979","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W964861289","https://openalex.org/W1488422606","https://openalex.org/W1570425181","https://openalex.org/W1985572324","https://openalex.org/W1995725694","https://openalex.org/W2031612682","https://openalex.org/W2063525042","https://openalex.org/W2067297441","https://openalex.org/W2074359677","https://openalex.org/W2084814858","https://openalex.org/W2111874279","https://openalex.org/W2125990029","https://openalex.org/W2150004999","https://openalex.org/W2280590529","https://openalex.org/W2404960361","https://openalex.org/W2800754909","https://openalex.org/W2949628502","https://openalex.org/W2996181449","https://openalex.org/W3184850399","https://openalex.org/W4207048092","https://openalex.org/W4220919512","https://openalex.org/W4313429647","https://openalex.org/W4316652444","https://openalex.org/W4385356976","https://openalex.org/W4385667336","https://openalex.org/W4388671702","https://openalex.org/W4389146350","https://openalex.org/W4396650212","https://openalex.org/W4399521042","https://openalex.org/W4400703224","https://openalex.org/W4404431477","https://openalex.org/W4413036484","https://openalex.org/W4413084749","https://openalex.org/W6929092080","https://openalex.org/W7110215014","https://openalex.org/W7111301074","https://openalex.org/W7137189118"],"related_works":[],"abstract_inverted_index":{"Bin":[0,42,124],"Packing":[1,43],"with":[2],"k":[3,33],"bins":[4],"is":[5,27,44,106],"a":[6,15,21,50,118],"fundamental":[7],"optimisation":[8],"problem":[9,135],"in":[10,57,99,148],"which":[11],"we":[12,116],"are":[13],"given":[14],"set":[16,31],"of":[17,36,96,110,136],"n":[18],"integers":[19],"and":[20,24,49,65,140],"capacity":[22],"T":[23],"the":[25,30,80,94],"goal":[26],"to":[28,75],"partition":[29],"into":[32],"subsets,":[34],"each":[35],"total":[37],"sum":[38],"at":[39],"most":[40],"T.":[41],"NP-hard":[45],"already":[46],"for":[47,123,145],"k=2":[48],"textbook":[51],"dynamic":[52],"programming":[53],"algorithm":[54],"solves":[55],"it":[56],"pseudopolynomial":[58],"time":[59,71,128],"O(n":[60],"Tk\u22121).":[61],"Jansen,":[62],"Kratsch,":[63],"Marx,":[64],"Schlotter":[66],"[JCSS\u201913]":[67],"proved":[68],"that":[69,103],"this":[70,114],"cannot":[72],"be":[73],"improved":[74,142],"(nT)o(k":[76],"/":[77],"logk)":[78],"assuming":[79],"Exponential":[81],"Time":[82],"Hypothesis":[83],"(ETH).":[84],"Their":[85],"result":[86,105],"has":[87],"become":[88],"an":[89,133],"important":[90],"building":[91],"block,":[92],"explaining":[93],"hardness":[95],"many":[97,146],"problems":[98],"parameterised":[100,149],"complexity.":[101,150],"Note":[102],"their":[104],"one":[107],"log-factor":[108],"short":[109],"being":[111],"tight.":[112],"In":[113],"paper,":[115],"prove":[117],"tight":[119],"ETH-based":[120],"lower":[121,143],"bound":[122],"Packing,":[125],"ruling":[126],"out":[127],"2o(n)":[129],"To(k).":[130],"This":[131],"answers":[132],"open":[134],"Jansen":[137],"et":[138],"al.":[139],"yields":[141],"bounds":[144],"applications":[147]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-06-10T00:00:00"}