A Linear Approximation Algorithm for 2-Dimensional Vector Packing
Data Structures and Algorithms
2011-03-02 v1 Discrete Mathematics
Abstract
We study the 2-dimensional vector packing problem, which is a generalization of the classical bin packing problem where each item has 2 distinct weights and each bin has 2 corresponding capacities. The goal is to group items into minimum number of bins, without violating the bin capacity constraints. We propose a \Theta}(n)-time approximation algorithm that is inspired by the O(n^2) algorithm proposed by Chang, Hwang, and Park.
Cite
@article{arxiv.1103.0260,
title = {A Linear Approximation Algorithm for 2-Dimensional Vector Packing},
author = {Ekow Otoo and Ali Pinar and Doron Rotem},
journal= {arXiv preprint arXiv:1103.0260},
year = {2011}
}