A new linear storage, polynomial-time approximation scheme for the subset-sum problem (Q1822965): Difference between revisions

@@ Property / cites work @@
+Time bounds for selection
@@ Property / cites work: Time bounds for selection / rank @@
+Normal rank
@@ Property / cites work @@
+Worst-case analysis of an approximation scheme for the subset-sum problem
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3888846
@@ Property / cites work: Q3888846 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for combinatorial problems
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for Knapsack Problems
+Normal rank
@@ Property / cites work @@
+Worst-case analysis of greedy algorithms for the subset-sum problem
+Normal rank
@@ Property / cites work @@
+Approximation schemes for the subset-sum problem: Survey and experimental analysis
+Normal rank