A Linear Approximation Algorithm for 2-Dimensional Vector Packing

Details A Linear Approximation Algorithm for 2-Dimensional Vector Packing A Linear Approximation Algorithm for 2-Dimensional Vector Packing

2011-03-01

arxiv.org/abs/1103.0260v1

Computer Science

Data Structures and Algorithms

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A Linear Approximation Algorithm for 2-Dimensional Vector Packing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Linear Approximation Algorithm for 2-Dimensional Vector Packing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Linear Approximation Algorithm for 2-Dimensional Vector Packing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-471941