1 citations · 1 across the 4 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2019★ 1 cited
A Fast Scalable Heuristic for Bin Packing
Srikrishnan Divakaran
In this paper we present a fast scalable heuristic for bin packing that partitions the given problem into identical sub-problems of constant size and solves these constant size sub…
cs.DS2019
Fast Approximation Schemes for Bin Packing
Srikrishnan Divakaran
We present new approximation schemes for bin packing based on the following two approaches: (1) partitioning the given problem into mostly identical sub-problems of constant size a…