A robust APTAS for the classical bin packing problem (Q1013966): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10107-007-0200-y
+Normal rank
@@ Property / OpenAlex ID @@
+W1988227873
@@ Property / OpenAlex ID: W1988227873 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3347319
@@ Property / cites work: Q3347319 / rank @@
+Normal rank
@@ Property / cites work @@
+Bin packing can be solved within 1+epsilon in linear time
+Normal rank
@@ Property / cites work @@
+Repacking helps in bounded space on-line bin-packing
+Normal rank
@@ Property / cites work @@
+Algorithms for the Relaxed Online Bin-Packing Model
+Normal rank
@@ Property / cites work @@
+Partially dynamic bin packing can be solved within \(1 + \varepsilon\) in (amortized) polylogarithmic time
+Normal rank
@@ Property / cites work @@
+Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps
+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 @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Q3818127
@@ Property / cites work: Q3818127 / rank @@
+Normal rank
@@ Property / cites work @@
+On the online bin packing problem
@@ Property / cites work: On the online bin packing problem / rank @@
+Normal rank
@@ Property / cites work @@
+Toeplitz Matrices Associated with a Semi-Infinite Laurent Series
+Normal rank
@@ Property / cites work @@
+An improved lower bound for on-line bin packing algorithms
+Normal rank
@@ Property / cites work @@
+Q4782696
@@ Property / cites work: Q4782696 / rank @@
+Normal rank