An efficient fully polynomial approximation scheme for the Subset-Sum problem. (Q1400576): Difference between revisions

@@ Property / cites work @@
+Q3241581
@@ Property / cites work: Q3241581 / rank @@
+Normal rank
@@ Property / cites work @@
+Hard Knapsack Problems
@@ Property / cites work: Hard Knapsack Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4886030
@@ Property / cites work: Q4886030 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3892056
@@ Property / cites work: Q3892056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3888846
@@ Property / cites work: Q3888846 / rank @@
+Normal rank
@@ Property / cites work @@
+A Fast Approximation Algorithm For The Subset-Sum Problem
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
+Normal rank
@@ Property / cites work @@
+Q4148017
@@ Property / cites work: Q4148017 / rank @@
+Normal rank
@@ Property / cites work @@
+A new fully polynomial time approximation scheme for the Knapsack problem
+Normal rank
@@ Property / cites work @@
+Improved dynamic programming in connection with an FPTAS for the knapsack problem
+Normal rank
@@ Property / cites work @@
+Q4370212
@@ Property / cites work: Q4370212 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for Knapsack Problems
+Normal rank
@@ Property / cites work @@
+A fully polynomial approximation algorithm for the 0-1 knapsack problem
+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
@@ Property / cites work @@
+Q3993418
@@ Property / cites work: Q3993418 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear Time Algorithms for Knapsack Problems with Bounded Weights
+Normal rank