Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A 17/10-approximation algorithm fork-bounded space on-line variable-sized bin packing

A 17/10-approximation algorithm fork-bounded space on-line variable-sized bin packing A version of thek-bounded space on-line bin packing problem, where a fixed collection of bin sizes is allowed, is considered. By packing large items into appropriate bins and closing appropriate bins, we can derive an algorithm with worst-case performance bound 1.7 fork≥3. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Acta Mathematicae Applicatae Sinica Springer Journals

A 17/10-approximation algorithm fork-bounded space on-line variable-sized bin packing

Acta Mathematicae Applicatae Sinica , Volume 14 (1) – Jul 3, 2007

Loading next page...
 
/lp/springer-journals/a-17-10-approximation-algorithm-fork-bounded-space-on-line-variable-cXwj0OEfcl
Publisher
Springer Journals
Copyright
Copyright © 1998 by Science Press
Subject
Mathematics; Applications of Mathematics; Math Applications in Computer Science; Theoretical, Mathematical and Computational Physics
ISSN
0168-9673
eISSN
1618-3932
DOI
10.1007/BF02677351
Publisher site
See Article on Publisher Site

Abstract

A version of thek-bounded space on-line bin packing problem, where a fixed collection of bin sizes is allowed, is considered. By packing large items into appropriate bins and closing appropriate bins, we can derive an algorithm with worst-case performance bound 1.7 fork≥3.

Journal

Acta Mathematicae Applicatae SinicaSpringer Journals

Published: Jul 3, 2007

References