A linear approximation algorithm for bin packing with absolute approximation factor 3/2

Authors:
Rudolf Berghammer;Florian Reuter
Affiliations:
Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität Kiel, Olshausenstraße 40, D-24098 Kiel, Germany;Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität Kiel, Olshausenstraße 40, D-24098 Kiel, Germany
Venue:
Science of Computer Programming
Year:
2003

Citing 5
Cited 1

Introduction to algorithms

Introduction to algorithms
Approximation algorithms for bin packing: a survey

Approximation algorithms for NP-hard problems
Verification of sequential and concurrent programs (2nd ed.)

Verification of sequential and concurrent programs (2nd ed.)
A Discipline of Programming

A Discipline of Programming
On the Refinement Calculus

On the Refinement Calculus

Cubage-Weight Balance Algorithm for the Scattered Goods Loading with Two Aims

ICCS '07 Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new approximation algorithm for the bin packing problem which has a linear running time and an absolute approximation factor of 3/2. It is known that this approximation factor is the best factor achievable, unless P = NP.