{"id":"https://openalex.org/W1999710117","doi":"https://doi.org/10.1142/s0129054113500354","title":"TWO FOR ONE: TIGHT APPROXIMATION OF 2D BIN PACKING","display_name":"TWO FOR ONE: TIGHT APPROXIMATION OF 2D BIN PACKING","publication_year":2013,"publication_date":"2013-12-01","ids":{"openalex":"https://openalex.org/W1999710117","doi":"https://doi.org/10.1142/s0129054113500354","mag":"1999710117"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054113500354","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054113500354","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","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/A5015556552","display_name":"Rolf Harren","orcid":null},"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":true,"raw_author_name":"ROLF HARREN","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik (MPII), Campus E1 4, 66123 Saarbr\u00fccken, Germany"],"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik (MPII), Campus E1 4, 66123 Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071305115","display_name":"Klaus Jansen","orcid":"https://orcid.org/0000-0001-8358-6796"},"institutions":[{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"funder","lineage":["https://openalex.org/I149899117"]},{"id":"https://openalex.org/I32021983","display_name":"Kiel University","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":["Universit\u00e4t Kiel, Institut f\u00fcr Informatik, Christian-Albrechts-Platz 4, 24118 Kiel, Germany","Algorithms and Complexity, MPI for Informatics, Max Planck Society"],"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Kiel, Institut f\u00fcr Informatik, Christian-Albrechts-Platz 4, 24118 Kiel, Germany","institution_ids":["https://openalex.org/I32021983"]},{"raw_affiliation_string":"Algorithms and Complexity, MPI for Informatics, Max Planck Society","institution_ids":["https://openalex.org/I149899117"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069147553","display_name":"Lars Pr\u00e4del","orcid":null},"institutions":[{"id":"https://openalex.org/I32021983","display_name":"Kiel University","ror":"https://ror.org/04v76ef78","country_code":"DE","type":"education","lineage":["https://openalex.org/I32021983"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"LARS PR\u00c4DEL","raw_affiliation_strings":["Universit\u00e4t Kiel, Institut f\u00fcr Informatik, Christian-Albrechts-Platz 4, 24118 Kiel, Germany"],"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Kiel, Institut f\u00fcr Informatik, Christian-Albrechts-Platz 4, 24118 Kiel, Germany","institution_ids":["https://openalex.org/I32021983"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025400327","display_name":"Ulrich M. Schwarz","orcid":null},"institutions":[{"id":"https://openalex.org/I32021983","display_name":"Kiel University","ror":"https://ror.org/04v76ef78","country_code":"DE","type":"education","lineage":["https://openalex.org/I32021983"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"ULRICH M. SCHWARZ","raw_affiliation_strings":["Universit\u00e4t Kiel, Institut f\u00fcr Informatik, Christian-Albrechts-Platz 4, 24118 Kiel, Germany"],"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Kiel, Institut f\u00fcr Informatik, Christian-Albrechts-Platz 4, 24118 Kiel, Germany","institution_ids":["https://openalex.org/I32021983"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070193017","display_name":"Rob van Stee","orcid":"https://orcid.org/0000-0002-3664-0865"},"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":"ROB VAN STEE","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik (MPII), Campus E1 4, 66123 Saarbr\u00fccken, Germany"],"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik (MPII), Campus E1 4, 66123 Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5015556552"],"corresponding_institution_ids":["https://openalex.org/I4210109712"],"apc_list":null,"apc_paid":null,"fwci":3.4931,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.91757139,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"24","issue":"08","first_page":"1299","last_page":"1327"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9998999834060669,"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.9998999834060669,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9975000023841858,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9952999949455261,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/bin-packing-problem","display_name":"Bin packing problem","score":0.9261627197265625},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.8493983745574951},{"id":"https://openalex.org/keywords/packing-problems","display_name":"Packing problems","score":0.6539509296417236},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5647962093353271},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5515428185462952},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.49032261967658997},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.47574400901794434},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.42245855927467346},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4054151773452759},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.392365038394928},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35764771699905396},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33299127221107483}],"concepts":[{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.9261627197265625},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.8493983745574951},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.6539509296417236},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5647962093353271},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5515428185462952},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.49032261967658997},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.47574400901794434},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.42245855927467346},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4054151773452759},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.392365038394928},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35764771699905396},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33299127221107483},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1142/s0129054113500354","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054113500354","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.368.4692","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.368.4692","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mpi-inf.mpg.de/~vanstee/TwoForOneRevised.pdf","raw_type":"text"},{"id":"pmh:oai:escidoc.org:escidoc:2079328","is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-0024-5B39-E","pdf_url":null,"source":{"id":"https://openalex.org/S7407052962","display_name":"Max Planck Digital Library","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W2019318803","https://openalex.org/W2031210751","https://openalex.org/W2045601300","https://openalex.org/W2059422698","https://openalex.org/W2060963575","https://openalex.org/W2081615832","https://openalex.org/W2094475624","https://openalex.org/W2098775996","https://openalex.org/W2104680817","https://openalex.org/W2112890683","https://openalex.org/W2117839333","https://openalex.org/W2155087380","https://openalex.org/W2618574501"],"related_works":["https://openalex.org/W2797538013","https://openalex.org/W2026961896","https://openalex.org/W4255148175","https://openalex.org/W2971368033","https://openalex.org/W2001915926","https://openalex.org/W2096053066","https://openalex.org/W2104955674","https://openalex.org/W2949755993","https://openalex.org/W2967935725","https://openalex.org/W3214829809"],"abstract_inverted_index":{"In":[0],"this":[1,39],"paper,":[2],"we":[3],"study":[4],"the":[5,24,33,62,70,74,83],"two-dimensional":[6],"geometrical":[7],"bin":[8],"packing":[9,19],"problem":[10,40,75,102],"(2DBP):":[11],"given":[12],"a":[13,18,56,95,98,104],"list":[14],"of":[15,20,28,67,87,94],"rectangles,":[16],"provide":[17],"all":[21],"these":[22],"into":[23,111],"smallest":[25],"possible":[26],"number":[27],"unit":[29],"bins":[30,113],"without":[31],"rotating":[32],"rectangles.":[34],"Beyond":[35],"its":[36],"theoretical":[37],"appeal,":[38],"has":[41],"many":[42],"practical":[43],"applications,":[44],"for":[45,73,97],"example":[46],"in":[47],"print":[48],"layout":[49],"and":[50,80,103],"VLSI":[51],"chip":[52],"design.":[53],"We":[54],"present":[55],"2-approximate":[57],"algorithm,":[58],"which":[59],"improves":[60],"over":[61],"previous":[63],"best":[64,71],"known":[65,84],"ratio":[66],"3,":[68],"matches":[69,82],"results":[72],"where":[76],"rotations":[77],"are":[78],"allowed":[79],"also":[81],"lower":[85],"bound":[86],"approximability.":[88],"Our":[89],"approach":[90],"makes":[91],"strong":[92],"use":[93],"PTAS":[96],"related":[99],"2D":[100],"knapsack":[101],"new":[105],"algorithm":[106],"that":[107],"can":[108],"pack":[109],"instances":[110],"two":[112],"if":[114],"OPT":[115],"=":[116],"1.":[117]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}