A 5/4 Linear Time Bin Packing Algorithm

@article{Bksi2000A5L,
  title={A 5/4 Linear Time Bin Packing Algorithm},
  author={J{\'o}zsef B{\'e}k{\'e}si and G{\'a}bor Galambos and Hans Kellerer},
  journal={J. Comput. Syst. Sci.},
  year={2000},
  volume={60},
  pages={145-160}
}
In 1985, Martel published a linear time algorithm with a 3 asymptotic worst-case ratio for the one-dimensional bin packing problem. The algorithm is based on a linear time classification of the sizes of the items, and thereafter according to the number of elements in certain subclasses pairing the items in a clever way. In his paper Martel mentioned a natural generalization of this algorithm, that suggested a 4 algorithm. Although this seemed to be very simple, the improvement has not been… CONTINUE READING
Related Discussions
This paper has been referenced on Twitter 15 times. VIEW TWEETS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 13 extracted citations

A hybrid queuing model for Virtual Machine placement in cloud data center

2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS) • 2015
View 4 Excerpts
Highly Influenced

Virtual machine consolidated placement based on multi-objective biogeography-based optimization

Future Generation Comp. Syst. • 2016
View 4 Excerpts
Highly Influenced

A Multi-objective Biogeography-Based Optimization for Virtual Machine Placement

2015 15th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing • 2015
View 4 Excerpts
Highly Influenced

A PSO Based VM Resource Scheduling Model for Cloud Computing

2015 IEEE International Conference on Computational Intelligence & Communication Technology • 2015
View 1 Excerpt

References

Publications referenced by this paper.
Showing 1-6 of 6 references

Fast algorithms for bin packing

D. S. Johnson
J. Comput. System Sci • 1974
View 6 Excerpts
Highly Influenced

A linear time bin-packing algorithm

C. U. Martel
Oper. Res. Lett • 1985
View 6 Excerpts
Highly Influenced

An efficient approximation scheme for the one-dimensional bin-packing problem

23rd Annual Symposium on Foundations of Computer Science (sfcs 1982) • 1982
View 1 Excerpt

Similar Papers

Loading similar papers…