Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps (Q4210166): Difference between revisions

@@ Property / cites work @@
+Parallel approximation algorithms for bin packing
@@ Property / cites work: Parallel approximation algorithms for bin packing / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic Bin Packing
@@ Property / cites work: Dynamic Bin Packing / rank @@
+Normal rank
@@ Property / cites work @@
+Bin packing can be solved within 1+epsilon in linear time
+Normal rank
@@ Property / cites work @@
+Analysis of a Compound Bin Packing Algorithm
@@ Property / cites work: Analysis of a Compound Bin Packing Algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
+Normal rank
@@ Property / cites work @@
+A 71/60 theorem for bin packing
@@ Property / cites work: A 71/60 theorem for bin packing / rank @@
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+A fully dynamic approximation scheme for all-pairs shortest paths in planar graphs
+Normal rank
@@ Property / cites work @@
+A simple on-line bin-packing algorithm
@@ Property / cites work: A simple on-line bin-packing algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+On-line bin packing in linear time
@@ Property / cites work: On-line bin packing in linear time / rank @@
+Normal rank
@@ Property / cites work @@
+New Algorithms for Bin Packing
@@ Property / cites work: New Algorithms for Bin Packing / rank @@
+Normal rank