A 5/4 linear time bin packing algorithm

DOI10.1006/jcss.1999.1667zbMath0961.68149OpenAlexW1973576806MaRDI QIDQ1975969

Hans Kellerer, József Békési, Gábor Galambos

Publication date: 28 May 2001

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.1999.1667

zbMATH Keywords

linear time algorithm

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (3)

Homogeneous grouping of non-prime steel products for online auctions: a case study ⋮ A multi-objective ant colony system algorithm for virtual machine placement in cloud computing ⋮ A note on the minimum bounded edge-partition of a tree

Cites Work

• A linear time bin-packing algorithm
• Parallel approximation algorithms for bin packing
• Bin packing can be solved within 1+epsilon in linear time
• Fast algorithms for bin packing
• On-line bin packing in linear time

This page was built for publication: A 5/4 linear time bin packing algorithm