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

Authors

447

  1. LE
    Leah Epstein

    University of Haifa, Israel

    14 publications · 385 citations

    12

    h-index

  2. NB
    Nikhil Bansal

    IBM (United States), United States

    11 publications · 505 citations

    11

    h-index

  3. JC
    János Csirik

    University of Szeged, Hungary

    11 publications · 489 citations

    11

    h-index

  4. JB
    József Békési

    University of Szeged, Hungary

    10 publications · 309 citations

    10

    h-index

  5. GD
    György Dósa

    University of Pannonia, Hungary

    11 publications · 312 citations

    10

    h-index

1–5 of 447

Venues

  1. SIAM Journal on Computing

    16 publications · 2.3K citations

    14

    h-index

  2. European Journal of Operational Research

    15 publications · 1.5K citations

    14

    h-index

  3. Discrete Applied Mathematics

    13 publications · 1K citations

    12

    h-index

  4. Operations Research Letters

    13 publications · 577 citations

    12

    h-index

  5. Information Processing Letters

    11 publications · 509 citations

    11

    h-index

1–5