Analysis of a first-fit algorithm for the capacitated unit covering problem
From MaRDI portal
Publication:4976332
DOI10.1080/00207160.2016.1190834zbMath1375.90253OpenAlexW2463056848MaRDI QIDQ4976332
Mohammadreza Razzazi, Taha Ghasemi
Publication date: 28 July 2017
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2016.1190834
Analysis of algorithms (68W40) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Cites Work
- Unnamed Item
- Tighter bounds of the First Fit algorithm for the bin-packing problem
- Online unit clustering: Variations on a theme
- Hitting sets when the VC-dimension is small
- Covering a set of points in multidimensional space
- Resource constrained scheduling as generalized bin packing
- Dynamic bin packing with unit fraction items revisited
- Fast algorithms for bin packing
- Approximation schemes for covering and packing problems in image processing and VLSI
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- On Packing Two-Dimensional Bins
- On Bin Packing with Conflicts