Improved approximation algorithms for multidimensional bin packing problems

@article{Bansal2006ImprovedAA,
  title={Improved approximation algorithms for multidimensional bin packing problems},
  author={Nikhil Bansal and Alberto Caprara and Maxim Sviridenko},
  journal={2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)},
  year={2006},
  pages={697-708}
}
In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the linear programming (LP) relaxation, leading to a partial integer solution, and the application of a well-behaved approximation algorithm to complete this solution. If the value of the solution returned by the latter can be bounded in a suitable way, as is the case for the most relevant generalizations of bin packing, the method leads… CONTINUE READING
Highly Influential
This paper has highly influenced a number of papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 100 citations. REVIEW CITATIONS

Topics

Statistics

0102030'07'08'09'10'11'12'13'14'15'16'17'18
Citations per Year

100 Citations

Semantic Scholar estimates that this publication has 100 citations based on the available data.

See our FAQ for additional information.