scientific article; zbMATH DE number 432833
From MaRDI portal
Publication:3138967
zbMATH Open0800.68478MaRDI QIDQ3138967FDOQ3138967
Publication date: 20 October 1993
Title of this publication is not available (Why is that?)
Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)
Cited In (7)
- Best \(k\)-fit bin packing
- Deep performance analysis of refined harmonic bin packing algorithm
- Repacking helps in bounded space on-line bin-packing
- On stable embeddability of partitions
- A \(17/10\)-approximation algorithm for \(k\)-bounded space on-line variable-sized bin packing
- Tight performance bound of \(AFBk\) bin packing
- On-line bin packing ? A restricted survey
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3138967)