Consider the following problem.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 256.
    J.D. Ullman. The performance of a memory allocation algorithm. Technical Report 100, Princeton University, Princeton, NJ, 1971.Google Scholar
  2. 92.
    W. Fernandez de la Vega and G.S. Lueker. Bin packing can be solved within 1 + e in linear time. Combinatorica, 1: 349–355, 1981.MathSciNetCrossRefGoogle Scholar
  3. 170.
    N. Karmakar and R.M. Karp. An efficient approximation scheme for the one-dimensional bin packing problem. In Proc. 23rd IEEE Annual Symposium on Foundations of Computer Science, pages 312–320, 1982.Google Scholar
  4. 52.
    E.G. Coffman Jr., M.R. Garey, and D.S. Johnson. Approximation algorithms for bin backing: a survey. In D.S. Hochbaum, editor, Approximation Algorithms for NP-Hard Problems, pages 46–93. PWS Publishing, Boston, MA, 1997.Google Scholar
  5. 192.
    H.W. Lenstra, Jr. Integer programming with a fixed number of variables. Mathematics of Operations Research, 8: 538–548, 1983.MathSciNetCrossRefGoogle Scholar
  6. 32.
    A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, Cambridge, UK, 1998.zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Vijay V. Vazirani
    • 1
  1. 1.Georgia Institute of TechnologyCollege of ComputingAtlantaUSA

Personalised recommendations