An FPTAS for the parametric knapsack problem (Q2361499): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2581390335
@@ Property / OpenAlex ID: W2581390335 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.07822
@@ Property / arXiv ID: 1701.07822 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
+Normal rank
@@ Property / cites work @@
+Q2718910
@@ Property / cites work: Q2718910 / rank @@
+Normal rank
@@ Property / cites work @@
+A fully polynomial approximation algorithm for the 0-1 knapsack problem
+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 @@
+Q4821303
@@ Property / cites work: Q4821303 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of some parametric integer and network programming problems
+Normal rank
@@ Property / cites work @@
+Parametric shortest path algorithms with an application to cyclic staffing
+Normal rank
@@ Property / cites work @@
+Faster parametric shortest path and minimum‐balance algorithms
+Normal rank
@@ Property / cites work @@
+Q3129922
@@ Property / cites work: Q3129922 / rank @@
+Normal rank
@@ Property / cites work @@
+A Fast Parametric Maximum Flow Algorithm and Applications
+Normal rank
@@ Property / cites work @@
+Fast Algorithms for Parametric Scheduling Come From Extensions to Parametric Maximum Flow
+Normal rank
@@ Property / cites work @@
+A note on the parametric maximum flow problem and some related reoptimization issues
+Normal rank
@@ Property / cites work @@
+Approximation schemes for the parametric knapsack problem
+Normal rank
@@ Property / cites work @@
+Parametric Solution for Linear Bicriteria Knapsack Models
+Normal rank
@@ Property / cites work @@
+Q4778556
@@ Property / cites work: Q4778556 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding the upper envelope of n line segments in O(n log n) time
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for Knapsack Problems
+Normal rank
@@ Property / cites work @@
+Q4947407
@@ Property / cites work: Q4947407 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2361499