{"id":"https://openalex.org/W1997959089","doi":"https://doi.org/10.1137/0209062","title":"Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms","display_name":"Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms","publication_year":1980,"publication_date":"1980-11-01","ids":{"openalex":"https://openalex.org/W1997959089","doi":"https://doi.org/10.1137/0209062","mag":"1997959089"},"language":"en","primary_location":{"id":"doi:10.1137/0209062","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0209062","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/A5110463438","display_name":"E. G. Coffman","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"E. G. Coffman, Jr.","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047995033","display_name":"M. R. Garey","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"M. R. Garey","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110866131","display_name":"David S. Johnson","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"D. S. Johnson","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5051027549","display_name":"Robert E. Tarjan","orcid":"https://orcid.org/0000-0001-7505-5768"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"R. E. Tarjan","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5110463438"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":31.5964,"has_fulltext":false,"cited_by_count":477,"citation_normalized_percentile":{"value":0.99803085,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"9","issue":"4","first_page":"808","last_page":"826"},"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.9958000183105469,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9894000291824341,"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.7950962781906128},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6729444265365601},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6376261711120605},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5964301228523254},{"id":"https://openalex.org/keywords/packing-problems","display_name":"Packing problems","score":0.5762192010879517},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5222409963607788},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.4956568479537964},{"id":"https://openalex.org/keywords/sphere-packing","display_name":"Sphere packing","score":0.4685424566268921},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4500954747200012},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.28576773405075073},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.10612601041793823}],"concepts":[{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.7950962781906128},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6729444265365601},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6376261711120605},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5964301228523254},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.5762192010879517},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5222409963607788},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.4956568479537964},{"id":"https://openalex.org/C183893376","wikidata":"https://www.wikidata.org/wiki/Q900117","display_name":"Sphere packing","level":2,"score":0.4685424566268921},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4500954747200012},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.28576773405075073},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.10612601041793823},{"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/0209062","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0209062","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":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W634463279","https://openalex.org/W2019318803","https://openalex.org/W2025787252","https://openalex.org/W2040877664","https://openalex.org/W2043862089","https://openalex.org/W2071027833"],"related_works":["https://openalex.org/W2087826159","https://openalex.org/W2160187088","https://openalex.org/W2066284144","https://openalex.org/W2067912448","https://openalex.org/W2061918649","https://openalex.org/W2953057619","https://openalex.org/W4300061951","https://openalex.org/W2546370215","https://openalex.org/W2006073952","https://openalex.org/W1997959089"],"abstract_inverted_index":{"We":[0],"analyze":[1],"several":[2],"\u201clevel-oriented\u201d":[3],"algorithms":[4,26],"for":[5,63,74],"packing":[6],"rectangles":[7,84],"into":[8],"a":[9],"unit-width,":[10],"infinite-height":[11],"bin":[12],"so":[13],"as":[14],"to":[15,41,93],"minimize":[16],"the":[17,21,24,32,35,39,42,60,79,82],"total":[18],"height":[19,36,44],"of":[20,34,81],"packing.":[22],"For":[23],"three":[25],"we":[27,29,69],"discuss,":[28],"show":[30],"that":[31],"ratio":[33],"obtained":[37],"by":[38,49],"algorithm":[40],"optimal":[43],"is":[45],"asymptotically":[46],"bounded,":[47],"respectively,":[48],"2,":[50],"1.7,":[51],"and":[52,87],"1.5.":[53],"The":[54],"latter":[55],"two":[56],"improve":[57],"substantially":[58],"over":[59],"performance":[61],"bounds":[62,73],"previously":[64],"proposed":[65],"algorithms.":[66],"In":[67],"addition,":[68],"give":[70],"more":[71],"refined":[72],"special":[75],"cases":[76],"in":[77,88],"which":[78,89],"widths":[80],"given":[83],"are":[85,92],"restricted":[86],"only":[90],"squares":[91],"be":[94],"packed.":[95]},"counts_by_year":[{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":9},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":16},{"year":2021,"cited_by_count":21},{"year":2020,"cited_by_count":12},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":15},{"year":2017,"cited_by_count":20},{"year":2016,"cited_by_count":14},{"year":2015,"cited_by_count":25},{"year":2014,"cited_by_count":16},{"year":2013,"cited_by_count":17},{"year":2012,"cited_by_count":16}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}