Probabilistic analysis of a bin covering algorithm (Q1919189): Difference between revisions

@@ 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/0167-6377(95)00053-4
+Normal rank
@@ Property / OpenAlex ID @@
+W2086436817
@@ Property / OpenAlex ID: W2086436817 / rank @@
+Normal rank
@@ Property / cites work @@
+On a dual version of the one-dimensional bin packing problem
+Normal rank
@@ Property / cites work @@
+Q3347319
@@ Property / cites work: Q3347319 / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistic analysis of algorithms for dual bin packing problems
+Normal rank
@@ Property / cites work @@
+Recurrence properties of Processes with stationary independent increments
+Normal rank
@@ Property / cites work @@
+Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems
+Normal rank
@@ Property / cites work @@
+A Note on Optimal Bin Packing and Optimal Bin Covering with Items of Random Size
+Normal rank
@@ Property / cites work @@
+Optimal Bin Covering with Items of Random Size
@@ Property / cites work: Optimal Bin Covering with Items of Random Size / rank @@
+Normal rank