A 5/4 linear time bin packing algorithm

DOI10.1006/JCSS.1999.1667MaRDI QIDQ1975969zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• A linear time bin-packing algorithm
• Linear time-approximation algorithms for bin packing
• On-line bin packing in linear time
• A linear approximation algorithm for bin packing with absolute approximation factor \(\frac {3}{2}\)

Cites work

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

Cited in

(6)

• A linear time bin-packing algorithm
• Linear time-approximation algorithms for bin packing
• 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
• Near-optimal algorithms for stochastic online bin packing
• A note on the minimum bounded edge-partition of a tree

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1975969)