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

DOI10.1007/BF02240206zbMath0577.68040MaRDI QIDQ1065544

János A. Csirik, Gábor Galambos

Publication date: 1986

Published in: Computing (Search for Journal in Brave)

zbMATH Keywords

probabilistic analysison-line algorithmheuristic algorithmbin- packing problem

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• 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

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