2021
DOI: 10.48550/arxiv.2105.02827
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Tight Approximation Algorithms for Geometric Bin Packing with Skewed Items

Abstract: In the Two-dimensional Bin Packing (2BP) problem, we are given a set of rectangles of height and width at most one and our goal is to find an axis-aligned nonoverlapping packing of these rectangles into the minimum number of unit square bins. The problem admits no APTAS and the current best approximation ratio is 1.406 by Bansal and Khan [SODA'14]. A well-studied variant of the problem is Guillotine Two-dimensional Bin Packing (G2BP), where all rectangles must be packed in such a way that every rectangle in th… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 27 publications
0
2
0
Order By: Relevance
“…It can be proved using standard techniques (e.g., Section 3.2.3 in [36]). See Appendix G.2 in [31] for a formal proof.…”
Section: :13mentioning
confidence: 99%
See 1 more Smart Citation
“…It can be proved using standard techniques (e.g., Section 3.2.3 in [36]). See Appendix G.2 in [31] for a formal proof.…”
Section: :13mentioning
confidence: 99%
“…We can rearrange the items in the bin so that all wide items touch the left edge of the bin and all tall items touch the bottom edge of the bin. See Appendix E in [31] for a formal proof and Figure 6 for an example.…”
Section: A Linear Groupingmentioning
confidence: 99%