Abstract
In this paper we give tighter bounds than were previously known for the performance of the bin packing algorithms Bets Fit and First Fit when the inputs are uniformly distributed on [0,1]. We also give a general lower bound for the performance of any on-line bin packing algorithm. These results are proven by analyzing problems concerning matching random points in a unit square. We give a new lower bound for upward right matching and grid matching.
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.
