Bin Packing Approximation
Bin Packing Approximation is an approximation algorithm designed to solve the bin packing problem by efficiently assigning a given set of items to the minimum number of fixed-capacity bins while guaranteeing a solution within a provable factor of the optimal.
267
Publications
17.9K
Citations
447
Authors
264
Institutions
Publications per year
2017–2026
32
Parents
267
Orthogonal Packings in Two Dimensions
Brenda S. Baker, E. G. Coffman, Ronald L. Rivest · SIAM Journal on Computing · 1980 · 695 citations
The Three-Dimensional Bin Packing Problem
Silvano Martello, David Pisinger, Daniele Vigo · Operations Research · 2000 · 652 citations
Fast algorithms for bin packing
David S. Johnson · Journal of Computer and System Sciences · 1974 · 536 citations
1–5 of 267
447
12
h-index
11
h-index
11
h-index
10
h-index
10
h-index
1–5 of 447
264

University of Szeged
Szeged, Hungary
17 h-index
32 publications
1.2K citations

University of Bologna
Bologna, Italy
15 h-index
27 publications
5.1K citations
University of Pannonia
Veszprém, Hungary
10 h-index
12 publications
328 citations
University of Haifa
Haifa, Israel
9 h-index
10 publications
214 citations
Massachusetts Institute of Technology
Cambridge, United States
9 h-index
11 publications
1.2K citations

Zhejiang University
Hangzhou, China
7 h-index
9 publications
311 citations

University of Modena and Reggio Emilia
Modena, Italy
7 h-index
13 publications
695 citations
Erasmus University Rotterdam
Rotterdam, The Netherlands
6 h-index
6 publications
399 citations
1–8 of 264
16 publications · 2.3K citations
14
h-index
15 publications · 1.5K citations
14
h-index
13 publications · 1K citations
12
h-index
13 publications · 577 citations
12
h-index
11 publications · 509 citations
11
h-index
1–5