A sublinear-time approximation scheme for bin packing (Q1034628): Difference between revisions

@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Approximating the Entropy
@@ Property / cites work: The Complexity of Approximating the Entropy / rank @@
+Normal rank
@@ Property / cites work @@
+Q4535797
@@ Property / cites work: Q4535797 / rank @@
+Normal rank
@@ Property / cites work @@
+On the sum-of-squares algorithm for bin packing
@@ Property / cites work: On the sum-of-squares algorithm for bin packing / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time
+Normal rank
@@ Property / cites work @@
+Sublinear‐time approximation algorithms for clustering via random sampling
+Normal rank
@@ Property / cites work @@
+Estimating the weight of metric minimum spanning trees in sublinear-time
+Normal rank
@@ Property / cites work @@
+On sums of independent random variables with unbounded variance, and estimating the average degree in a graph
+Normal rank
@@ Property / cites work @@
+Bin packing can be solved within 1+epsilon in linear time
+Normal rank
@@ Property / cites work @@
+A Linear Programming Approach to the Cutting-Stock Problem
+Normal rank
@@ Property / cites work @@
+A Linear Programming Approach to the Cutting Stock Problem—Part II
+Normal rank
@@ Property / cites work @@
+Property testing and its connection to learning and approximation
+Normal rank
@@ Property / cites work @@
+Property testing in bounded degree graphs
@@ Property / cites work: Property testing in bounded degree graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating Average Parameters of Graphs
@@ Property / cites work: Approximating Average Parameters of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Sublinear time algorithms for metric space problems
+Normal rank
@@ Property / cites work @@
+Optimal time bounds for approximate clustering
@@ Property / cites work: Optimal time bounds for approximate clustering / rank @@
+Normal rank
@@ Property / cites work @@
+Q2768331
@@ Property / cites work: Q2768331 / rank @@
+Normal rank
@@ Property / cites work @@
+Estimating Sum by Weighted Sampling
@@ Property / cites work: Estimating Sum by Weighted Sampling / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms
+Normal rank
@@ Property / cites work @@
+Quick <i>k</i>-Median, <i>k</i>-Center, and Facility Location for Sparse Graphs
+Normal rank