On the absolute approximation ratio for first fit and related results (Q442205): Difference between revisions

@@ Property / DOI @@
-.1016/j.dam.2012.04.012
@@ Property / DOI: 10.1016/j.dam.2012.04.012 / rank @@
-Normal rank
@@ Property / author @@
+Joan. Boyar
@@ Property / author: Joan. Boyar / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2012.04.012
+Normal rank
@@ Property / OpenAlex ID @@
+W1998334645
@@ Property / OpenAlex ID: W1998334645 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2934601
@@ Property / cites work: Q2934601 / rank @@
+Normal rank
@@ Property / cites work @@
+Paging and list update under bijective analysis
@@ Property / cites work: Paging and list update under bijective analysis / rank @@
+Normal rank
@@ Property / cites work @@
+Tight results for next fit and worst fit with resource augmentation
+Normal rank
@@ Property / cites work @@
+The relative worst order ratio for online algorithms
+Normal rank
@@ Property / cites work @@
+A comparison of performance measures for online algorithms
+Normal rank
@@ Property / cites work @@
+Resource constrained scheduling as generalized bin packing
+Normal rank
@@ Property / cites work @@
+Fast algorithms for bin packing
@@ Property / cites work: Fast algorithms for bin packing / rank @@
+Normal rank
@@ Property / cites work @@
+Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
+Normal rank
@@ Property / cites work @@
+Q4290987
@@ Property / cites work: Q4290987 / rank @@
+Normal rank
@@ Property / cites work @@
+Tighter bounds of the First Fit algorithm for the bin-packing problem
+Normal rank
@@ Property / DOI @@
+.1016/J.DAM.2012.04.012
@@ Property / DOI: 10.1016/J.DAM.2012.04.012 / rank @@
+Normal rank