An O(n) bin-packing algorithm for uniformly distributed data

DOI10.1007/BF02240206MaRDI QIDQ1065544zbMATH OpenFDO

Authors János Csirik, Gábor Galambos

Publication date 1986

Published in Computing (Search for Journal in Brave)

zbMATH Keywords

heuristic algorithmon-line algorithmprobabilistic analysisbin- packing problem

Mathematics Subject Classification ID

Data structures (68P05) Algorithms in computer science (68W99)

Recommendations

• scientific article; zbMATH DE number 1870507
• On the sum-of-squares algorithm for bin packing
• The average-case analysis of some on-line algorithms for bin packing
• On-Line Bin Packing of Items of Random Sizes, II
• Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings

Cites work

• scientific article; zbMATH DE number 3722129 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Bin packing as a random walk: A note on Knödel's paper
• Probabilistic analysis for simple one- and two-dimensional bin packing algorithms
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms

Cited in

(8)

• scientific article; zbMATH DE number 1870507 (Why is no real title available?)
• On the sum-of-squares algorithm for bin packing
• scientific article; zbMATH DE number 62475 (Why is no real title available?)
• Interior-point-based online stochastic bin packing
• On-Line Bin Packing of Items of Random Sizes, II
• Bin packing using semi-ordinal data
• The average-case analysis of some on-line algorithms for bin packing
• On the Sum-of-Squares algorithm for bin packing

This page was built for publication: An O(n) bin-packing algorithm for uniformly distributed data

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