A linear approximation algorithm for bin packing with absolute approximation factor 32

Publisher： Elsevier

ISSN： 0167-6423

Source： Science of Computer Programming, Vol.48, Iss.1, 2003-07, pp. : 67-80

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Approximation Algorithms for Extensible Bin Packing

By Coffman E. Lueker George

Journal of Scheduling, Vol. 9, Iss. 1, 2006-02 ,pp. : 63-69

Springer Publishing Company

Access to resources Recommend Favorite

Approximation algorithms for a hierarchically structured bin packing problem

By Codenotti B. De Marco G. Leoncini M. Montangero M. Santini M.

Information Processing Letters, Vol. 89, Iss. 5, 2004-03 ,pp. : 215-221

Elsevier

Access to resources Recommend Favorite

An Approximation Algorithm for Binary Searching in Trees

By Laber Eduardo Molinaro Marco

Algorithmica, Vol. 59, Iss. 4, 2011-04 ,pp. : 601-620

Springer Publishing Company

Access to resources Recommend Favorite

New approximation algorithm for RTILE problem

By Lorys K. Paluch K.E.

Theoretical Computer Science, Vol. 303, Iss. 2, 2003-07 ,pp. : 517-537

Elsevier

Access to resources Recommend Favorite

A new heuristic algorithm for the one-dimensional bin-packing problem

By Gupta J. N. D. Ho J. C.

Production Planning and Control, Vol. 10, Iss. 6, 1999-09 ,pp. : 598-603

Taylor & Francis Ltd

Access to resources Recommend Favorite