Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Better Multi-dimesional Bin Packing in Special Nitin Ahuja and Anand Srivastav
 

Summary: Better Multi-dimesional Bin Packing in Special
Cases
Nitin Ahuja and Anand Srivastav
Mathematisches Seminar
Christian-Albrechts-Universitšat zu Kiel
Ludewig-Meyn-Str. 4, 24098 Kiel, Germany.
{nia,asr}@numerik.uni-kiel.de
Extended Abstract
Abstract. We give a modified version of the vector packing algorithm
of Chekuri and Khanna [1]. The performance ratio of this algorithm
is the same as that of [1] in the worst case but beats their bound in
special cases. We also characterize classes of problem instances for which
our algorithm beats the previous best bound and the inapproximability
bound respectively.
1 Introduction
Multi-Dimensional Bin Packing (MDBP) or Vector Packing (VP) problem is
the following: given n rational vectors v1, . . . , vn [0, 1]d
, pack these vectors
in minimum number of bins, say m, such that iBj
vi 1 for each bin

  

Source: Ahuja, Nitin - Fachbereich Mathematik und Informatik, Technische Universität Braunschweig

 

Collections: Mathematics