Analysis of Binpacking
Journal Title: IOSR Journals (IOSR Journal of Computer Engineering) - Year 2012, Vol 1, Issue 1
Abstract
The main objective of this problem is to pack objects of fixed volume into bins, each of them having a maximum capacity, so as to minimize the total number of bins used. Binpacking is an Np-complete problem as the number items increases, to pack the items in n bins, It cannot be done in polynomial time. Hence we convert the Np problem to P problem in our approach. There are several methods to solve this problem. The most straightforward solution would be the first fit algorithm. Here each object is compared against all the bins to try find the first bin which could accommodate the object. Insert a set of n numbers into as few bins as possible, such that the sum of the numbers assigned to each bin does not exceed the bin capacity, we firstly prove it to be NP problem and solve as P problem after transformation.
Authors and Affiliations
Mrs. Nirmala J.
Keywords
Related Articles
- EP ID EP125536
- DOI -
- Views 91
- Downloads 0
“The Impact Of Incentives To Indigenous Farmers (A1 And A 2) In Maize Production In Zimbabwe” A Case Of Mashonaland East Province, Macheke, Zimbabwe.
Abstract: The current study was concerned with the need to establish incentives for farmers to boostproduction of maize in Macheke, Mashonaland East Province, in Zimbabwe. This study was motivated by anobservation that t...
Survey on Routing Protocols for Under Water Sensor Networks
There are certain routing protocols in underwater sensor network. Providing efficient protocols for underwater sensor networks is a challenging factor. UNSW often uses acoustic channels instead of Radio channel...
Cuckoo Search based Optimal Elliptic Curve Cryptography (OECC) for Text Encryption
Abstract : The Cryptography converts our original text information into non understandable form of text that is cipher text which is more powerful because which is not understandable. . In this work we are implemented th...
Soundness to Single Sign on Using OTP in Distributed Networks
In a distributed system, there are numerous service provider. The user must be authenticated to entrance the services provided by the service provider. It is challenging to recall all secret words for users. So to c...
Topic-specific Web Crawler using Probability Method
Web has become an integral part of our lives and search engines play an important role in making users search the content online using specific topic. The web is a huge and highly dynamic environment which is &nb...