1. Coffman, E. G., & Lueker, G. S. (1991). Probabilistic analysis of packing and partitioning algorithms. Wiley-Interscience.
2. Coffman, E. G., Garey, M. R., & Johnson, D. S. (1997). Approximation algorithms for bin packing: a survey. In D. S. Hochbaum (Ed.), Approximation algorithms for NP-hard problems (pp. 46–93). Boston: PWS Publishing.
3. de la Vega, W. F., & Lueker, G. S. (1981). Bin packing can␣be solved within 1 + ε in linear time. Combinatorica, 1(4), 349–355.
4. Feeney, L. M., & Nilsson, M. (2001). Investigating the energy consumption of a wireless network interface in an ad hoc networking environment. In Proceedings of IEEE INFOCOM 2001, pp. 1548–1557.
5. Garey, M., & Johnson, D. (1979). Computers and intractability: a guide to the theory of NP completeness. New York: W.H. Freeman and Company.