Fully polynomial approximation schemes for locating a tree-shaped facility: A generalization of the knapsack problem (Q1270784): Difference between revisions

@@ Property / cites work @@
+An Algorithm for Large Zero-One Knapsack Problems
@@ Property / cites work: An Algorithm for Large Zero-One Knapsack Problems / rank @@
+Normal rank
@@ Property / cites work @@
+`` Strong '' NP-Completeness Results
@@ Property / cites work: `` Strong '' NP-Completeness Results / rank @@
+Normal rank
@@ Property / cites work @@
+Q3787797
@@ Property / cites work: Q3787797 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3050129
@@ Property / cites work: Q3050129 / rank @@
+Normal rank
@@ Property / cites work @@
+On locating path- or tree-shaped facilities on networks
+Normal rank
@@ Property / cites work @@
+Maximal Direct Covering Tree Problems
@@ Property / cites work: Maximal Direct Covering Tree Problems / rank @@
+Normal rank
@@ Property / cites work @@
+On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for the capacitated plant allocation problem
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for Knapsack Problems
+Normal rank
@@ Property / cites work @@
+The optimal location of a path or tree in a tree network
+Normal rank
@@ Property / cites work @@
+On a tree-shaped facility location problem of Minieka
+Normal rank
@@ Property / cites work @@
+Combinatorial Problems: Reductibility and Approximation
+Normal rank
@@ Property / cites work @@
+Obnoxious Facility Location on Graphs
@@ Property / cites work: Obnoxious Facility Location on Graphs / rank @@
+Normal rank