{"id":"https://openalex.org/W4389146350","doi":"https://doi.org/10.1137/22m1478112","title":"A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics","display_name":"A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics","publication_year":2023,"publication_date":"2023-11-29","ids":{"openalex":"https://openalex.org/W4389146350","doi":"https://doi.org/10.1137/22m1478112"},"language":"en","primary_location":{"id":"doi:10.1137/22m1478112","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1137/22m1478112","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5068357631","display_name":"Jesper Nederlof","orcid":"https://orcid.org/0000-0003-1848-0076"},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Jesper Nederlof","raw_affiliation_strings":["Department of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands"],"raw_orcid":"https://orcid.org/0000-0003-1848-0076","affiliations":[{"raw_affiliation_string":"Department of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064343784","display_name":"Jakub Pawlewicz","orcid":"https://orcid.org/0000-0003-4670-9106"},"institutions":[{"id":"https://openalex.org/I4210152232","display_name":"Institute of Informatics of the Slovak Academy of Sciences","ror":"https://ror.org/04jgqpc26","country_code":"SK","type":"facility","lineage":["https://openalex.org/I207624831","https://openalex.org/I4210152232"]}],"countries":["SK"],"is_corresponding":false,"raw_author_name":"Jakub Pawlewicz","raw_affiliation_strings":["IDEAS NCBR and Institute of Informatics, Faculty of Mathematics, Informatics, and Mechanics, University of Warsaw, Warsaw, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IDEAS NCBR and Institute of Informatics, Faculty of Mathematics, Informatics, and Mechanics, University of Warsaw, Warsaw, Poland","institution_ids":["https://openalex.org/I4210152232"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053202642","display_name":"C\u00e9line M. F. Swennenhuis","orcid":"https://orcid.org/0000-0001-9654-8094"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"C\u00e9line M. F. Swennenhuis","raw_affiliation_strings":["Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands"],"raw_orcid":"https://orcid.org/0000-0001-9654-8094","affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"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"]},{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Karol W\u0119grzycki","raw_affiliation_strings":["Saarland University and Max-Planck-Institute for Informatics, Saarland Informatics Campus, Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Saarland University and Max-Planck-Institute for Informatics, Saarland Informatics Campus, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712","https://openalex.org/I91712215"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5068357631"],"corresponding_institution_ids":["https://openalex.org/I193662353"],"apc_list":null,"apc_paid":null,"fwci":0.194,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.57916224,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":98},"biblio":{"volume":"52","issue":"6","first_page":"1369","last_page":"1412"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9993000030517578,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9991000294685364,"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/bin-packing-problem","display_name":"Bin packing problem","score":0.7903083562850952},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7318165302276611},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7245567440986633},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.6731612682342529},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6156934499740601},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.608920693397522},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5800970196723938},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.5197222232818604},{"id":"https://openalex.org/keywords/notation","display_name":"Notation","score":0.5130985975265503},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4867379665374756},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.44387489557266235},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3721717894077301},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.15265995264053345},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1516057550907135}],"concepts":[{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.7903083562850952},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7318165302276611},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7245567440986633},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.6731612682342529},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6156934499740601},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.608920693397522},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5800970196723938},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.5197222232818604},{"id":"https://openalex.org/C45357846","wikidata":"https://www.wikidata.org/wiki/Q2001982","display_name":"Notation","level":2,"score":0.5130985975265503},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4867379665374756},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.44387489557266235},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3721717894077301},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.15265995264053345},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1516057550907135},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/22m1478112","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1137/22m1478112","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1512887187","display_name":null,"funder_award_id":"677651","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"},{"id":"https://openalex.org/G2410103071","display_name":null,"funder_award_id":"850979","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"},{"id":"https://openalex.org/G4009995372","display_name":null,"funder_award_id":"853234","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"},{"id":"https://openalex.org/G7058492796","display_name":null,"funder_award_id":"2016/21/N/ST6/01468","funder_id":"https://openalex.org/F4320321042","funder_display_name":"Fundacja na rzecz Nauki Polskiej"},{"id":"https://openalex.org/G8847064072","display_name":null,"funder_award_id":"2018/28/T/ST6/00084","funder_id":"https://openalex.org/F4320321042","funder_display_name":"Fundacja na rzecz Nauki Polskiej"}],"funders":[{"id":"https://openalex.org/F4320321042","display_name":"Fundacja na rzecz Nauki Polskiej","ror":"https://ror.org/048zd9m77"},{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W90213227","https://openalex.org/W413839732","https://openalex.org/W1497895992","https://openalex.org/W1527908019","https://openalex.org/W1747610753","https://openalex.org/W1972100372","https://openalex.org/W2010662359","https://openalex.org/W2015963099","https://openalex.org/W2032938251","https://openalex.org/W2045492613","https://openalex.org/W2047705353","https://openalex.org/W2055309977","https://openalex.org/W2060453713","https://openalex.org/W2063525042","https://openalex.org/W2074359677","https://openalex.org/W2081131431","https://openalex.org/W2090960684","https://openalex.org/W2125554210","https://openalex.org/W2137384791","https://openalex.org/W2159641801","https://openalex.org/W2172810949","https://openalex.org/W2230017674","https://openalex.org/W2342137734","https://openalex.org/W2404960361","https://openalex.org/W2564022051","https://openalex.org/W2597941492","https://openalex.org/W2739532832","https://openalex.org/W2892948282","https://openalex.org/W2914414140","https://openalex.org/W2963188610","https://openalex.org/W3005613116","https://openalex.org/W3166470924","https://openalex.org/W4206253867","https://openalex.org/W4230158058"],"related_works":["https://openalex.org/W2797538013","https://openalex.org/W2026961896","https://openalex.org/W173368591","https://openalex.org/W2034272113","https://openalex.org/W2138242427","https://openalex.org/W4288260564","https://openalex.org/W4255148175","https://openalex.org/W2971368033","https://openalex.org/W2001915926","https://openalex.org/W2096053066"],"abstract_inverted_index":{"In":[0,61],"the":[1,21,58,107,115],"Bin":[2,50,78],"Packing":[3,51,79],"problem":[4],"one":[5],"is":[6,18,106],"given":[7],"items":[8,22],"with":[9,13,80],"weights":[10],"and":[11,36],"bins":[12,81],"capacities":[14],".":[15,33,99,133],"The":[16],"goal":[17],"to":[19],"partition":[20],"into":[23],"sets":[24],"such":[25,73,91,126],"that":[26,66,74,127],"for":[27,49,67,98,129],"every":[28,68,122],"bin":[29],",":[30,131],"where":[31],"denotes":[32],"Bj\u00f6rklund,":[34],"Husfeldt,":[35],"Koivisto":[37],"[SIAM":[38],"J.":[39],"Comput.,":[40],"39":[41],"(2009),":[42],"pp.":[43],"546\u2013563]":[44],"presented":[45],"an":[46,75,125],"time":[47],"algorithm":[48],"(the":[52],"notation":[53],"omits":[54],"factors":[55],"polynomial":[56],"in":[57,85,103,111],"input":[59],"size).":[60],"this":[62],"paper,":[63],"we":[64],"show":[65],"there":[69,123],"exists":[70,124],"a":[71],"constant":[72],"instance":[76],"of":[77,118],"can":[82],"be":[83],"solved":[84],"randomized":[86],"time.":[87],"Before":[88],"our":[89,104],"work,":[90],"improved":[92],"algorithms":[93],"were":[94],"not":[95],"known":[96],"even":[97],"A":[100],"key":[101],"step":[102],"approach":[105],"following":[108],"new":[109],"result":[110],"Littlewood\u2013Offord":[112],"theory":[113],"on":[114],"additive":[116],"combinatorics":[117],"subset":[119],"sums:":[120],"For":[121],"if":[128],"some":[130],"then":[132]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2025-12-22T23:10:17.713674","created_date":"2025-10-10T00:00:00"}