Abstract
We consider the problem of packing n items, which are drawn according to a probability distribution whose density function is triangular in shape, into bins of unit capacity. For triangles which represent density functions whose expectation is 1/p for p = 3, 4, 5,…, we give a packing strategy for which the ratio of the number of bins used in the packing to the expected total size of the items asymptotically approaches 1.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
