AbstractWe consider approximate PCPs for multidimensional bin-packing problems. In particular, we show how a verifier can be quickly convinced that a set of multidimensional blocks can be packed into a small number of bins. The running time of the verifier is bounded by O(logdn) where n is the number of blocks and d is the dimension
Since the Bin Packing Problem (BPP) is one of the main NP-hard problems, a lot of approximation algo...
The bin packing problem has been the corner stone of approximation algorithms and has been extensive...
AbstractThe two-dimensional bin packing problem is a generalization of the classical bin packing pro...
We consider approximate PCPs for multidimensional bin-packing problems. In particular, we show how a...
AbstractWe consider approximate PCPs for multidimensional bin-packing problems. In particular, we sh...
We consider the d-dimensional cube packing problem (d-CPP): given a list L of d-dimensional cubes an...
We consider the d-dimensional cube packing problem (d-CPP): given a list L of d-dimensional cubes an...
We study the following packing problem: Given a collection of d-dimensional rectangles of specified ...
We present approximation algorithms for the following problems: the two-dimensional bin packing (2BP...
A comparative study is made of algorithms for a general multidimensional problem involving the packi...
textabstractWe solve an open problem in the literature by providing an online algorithm for multidim...
We present approximation algorithms for the two- and three-dimensional bin packing problems and the ...
AbstractWe study the parallel complexity of polynomial heuristics for the bin packing problem. We sh...
The two-dimensional bin packing problem is a generalization of the classical bin packing problem and...
We solve an open problem in the literature by providing an online algorithm for multidimensional bin...
Since the Bin Packing Problem (BPP) is one of the main NP-hard problems, a lot of approximation algo...
The bin packing problem has been the corner stone of approximation algorithms and has been extensive...
AbstractThe two-dimensional bin packing problem is a generalization of the classical bin packing pro...
We consider approximate PCPs for multidimensional bin-packing problems. In particular, we show how a...
AbstractWe consider approximate PCPs for multidimensional bin-packing problems. In particular, we sh...
We consider the d-dimensional cube packing problem (d-CPP): given a list L of d-dimensional cubes an...
We consider the d-dimensional cube packing problem (d-CPP): given a list L of d-dimensional cubes an...
We study the following packing problem: Given a collection of d-dimensional rectangles of specified ...
We present approximation algorithms for the following problems: the two-dimensional bin packing (2BP...
A comparative study is made of algorithms for a general multidimensional problem involving the packi...
textabstractWe solve an open problem in the literature by providing an online algorithm for multidim...
We present approximation algorithms for the two- and three-dimensional bin packing problems and the ...
AbstractWe study the parallel complexity of polynomial heuristics for the bin packing problem. We sh...
The two-dimensional bin packing problem is a generalization of the classical bin packing problem and...
We solve an open problem in the literature by providing an online algorithm for multidimensional bin...
Since the Bin Packing Problem (BPP) is one of the main NP-hard problems, a lot of approximation algo...
The bin packing problem has been the corner stone of approximation algorithms and has been extensive...
AbstractThe two-dimensional bin packing problem is a generalization of the classical bin packing pro...
DOI
Add to ORKG