Approximate algorithms for the Knapsack problem on parallel computers (Q757041): Difference between revisions

@@ Property / author @@
-Q757040
@@ Property / author: Q757040 / rank @@
-Normal rank
@@ Property / author @@
+Laveen N. Kanal
@@ Property / author: Laveen N. Kanal / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0890-5401(91)90063-8
+Normal rank
@@ Property / OpenAlex ID @@
+W2079885221
@@ Property / OpenAlex ID: W2079885221 / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel Merge Sort
@@ Property / cites work: Parallel Merge Sort / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate algorithms for the Knapsack problem on parallel computers
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for Knapsack Problems
+Normal rank
@@ Property / cites work @@
+Q4739657
@@ Property / cites work: Q4739657 / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel approximation schemes for subset sum and knapsack problems
+Normal rank
@@ Property / cites work @@
+Combinatorial Problems: Reductibility and Approximation
+Normal rank