Improved Approximation for Vector Bin Packing

DOI10.1137/1.9781611974331.CH106MaRDI QIDQ4575690zbMATH OpenOpenAlexFDO

Authors N. Bansal, Marek Eliáš, Arindam Khan

Publication date 16 July 2018

Published in Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611974331.ch106

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Recommendations

• Improved approximation algorithm for two-dimensional bin packing
• An improved approximation scheme for variable-sized bin packing
• An improved approximation scheme for variable-sized bin packing
• scientific article; zbMATH DE number 4195184
• Approximation algorithms for extensible bin packing
• Approximation algorithms for extensible bin packing
• Approximation schemes for ordered vector packing problems
• scientific article; zbMATH DE number 1833403
• An Efficient Approximation Scheme for Variable-Sized Bin Packing
• An improved lower bound for the bin packing problem

Cited in

(35)

• Sequential Vector Packing
• Updated estimates for algorithms for packing 2-bar charts in a strip
• scientific article; zbMATH DE number 7559382 (Why is no real title available?)
• Price-and-branch heuristic for vector bin packing
• The container selection problem
• scientific article; zbMATH DE number 1833403 (Why is no real title available?)
• A Tight (3/2+ε) Approximation for Skewed Strip Packing.
• On Multidimensional Packing Problems
• An improved approximation for packing big two-bar charts
• A posteriori analysis of the algorithms for two-bar charts packing problem
• Vector bin packing with multiple-choice
• There is no asymptotic PTAS for two-dimensional vector packing
• Polynomial approximation schemes for smoothed and random instances of multidimensional packing problems
• Streaming algorithms for bin packing and vector scheduling
• Improved hardness of approximation for geometric bin packing
• On data reduction for dynamic vector bin packing
• Approximating vector scheduling: almost matching upper and lower bounds
• Approximating vector scheduling: almost matching upper and lower bounds
• Tight approximation algorithms for geometric bin packing with skewed items
• Approximation schemes for ordered vector packing problems
• Approximation and online algorithms for multidimensional bin packing: a survey
• Improved bounds for harmonic-based bin packing algorithms
• Vector bin packing with multiple-choice (extended abstract)
• On Guillotine Separability of Squares and Rectangles.
• Two-bar charts packing problem
• There is no APTAS for 2-dimensional vector bin packing: revisited
• Sequential vector packing
• Packing small vectors
• Improved approximation for two-dimensional vector multiple knapsack
• Three-Bar Charts Packing Problem
• Approximation algorithms for a virtual machine allocation problem with finite types
• Tight bounds for online vector bin packing
• An EPTAS for cardinality constrained multiple knapsack via iterative randomized rounding
• Truthful mechanism design for bin packing with applications on cloud computing
• The preemptive resource allocation problem

This page was built for publication: Improved Approximation for Vector Bin Packing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4575690)