On the Worst-case Performance of the Sum-of-Squares Algorithm for Bin Packing

Details On the Worst-case Performance of the Sum-of-Squares Algorithm for Bin Packing On the Worst-case Performance of the Sum-of-Squares Algorithm for Bin Packing

2005-09-12

arxiv.org/abs/cs/0509031v1

Computer Science

Data Structures and Algorithms

Scientific paper

The Sum of Squares algorithm for bin packing was defined in [2] and studied
in great detail in [1], where it was proved that its worst case performance
ratio is at most 3. In this note, we improve the asymptotic worst case bound to
2.7777...

Affiliated with

Also associated with

No associations

Rating

On the Worst-case Performance of the Sum-of-Squares Algorithm for Bin 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 On the Worst-case Performance of the Sum-of-Squares Algorithm for Bin Packing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Worst-case Performance of the Sum-of-Squares Algorithm for Bin Packing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-1597