Approximability of Two Variants of Multiple Knapsack Problems (Q2947034): Difference between revisions

@@ Property / OpenAlex ID @@
+W2095673391
@@ Property / OpenAlex ID: W2095673391 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4437507
@@ Property / cites work: Q4437507 / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient approximation for the generalized assignment problem
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for the multiple knapsack problem with assignment restrictions
+Normal rank
@@ Property / cites work @@
+Tight Approximation Algorithms for Maximum Separable Assignment Problems
+Normal rank
@@ Property / cites work @@
+A new polynomial-time algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+A new fully polynomial time approximation scheme for the Knapsack problem
+Normal rank
@@ Property / cites work @@
+Q5519710
@@ Property / cites work: Q5519710 / rank @@
+Normal rank
@@ Property / cites work @@
+A fully polynomial approximation algorithm for the 0-1 knapsack problem
+Normal rank
@@ Property / cites work @@
+A \((1-1/e)\)-approximation algorithm for the generalized assignment problem
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for the generalized assignment problem
+Normal rank
@@ Property / cites work @@
+Linear degree extractors and the inapproximability of max clique and chromatic number
+Normal rank