Improved Approximation for Vector Bin Packing

DOI10.1137/1.9781611974331.ch106zbMath1414.90301OpenAlexW4237245198MaRDI QIDQ4575690

Marek Eliáš, Arindam Khan, Nikhil Bansal

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)

Related Items (14)

A Posteriori Analysis of the Algorithms for Two-Bar Charts Packing Problem ⋮ Approximation and online algorithms for multidimensional bin packing: a survey ⋮ On data reduction for dynamic vector bin packing ⋮ Tight approximation algorithms for geometric bin packing with skewed items ⋮ There is no APTAS for 2-dimensional vector bin packing: revisited ⋮ Approximation algorithms for a virtual machine allocation problem with finite types ⋮ Three-Bar Charts Packing Problem ⋮ An improved approximation for packing big two-bar charts ⋮ On Guillotine Separability of Squares and Rectangles. ⋮ A Tight (3/2+ε) Approximation for Skewed Strip Packing. ⋮ Unnamed Item ⋮ Streaming algorithms for bin packing and vector scheduling ⋮ Two-bar charts packing problem ⋮ Truthful mechanism design for bin packing with applications on cloud computing

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