Minimum cost partitions of trees with supply and demand (Q1934311): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00453-011-9573-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2090058386
@@ Property / OpenAlex ID: W2090058386 / rank @@
+Normal rank
@@ Property / cites work @@
+A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
+Normal rank
@@ Property / cites work @@
+Approximability of partitioning graphs with supply and demand
+Normal rank
@@ Property / cites work @@
+Minimum Cost Partitions of Trees with Supply and Demand
+Normal rank
@@ Property / cites work @@
+PARTITIONING TREES OF SUPPLY AND DEMAND
@@ Property / cites work: PARTITIONING TREES OF SUPPLY AND DEMAND / rank @@
+Normal rank
@@ Property / cites work @@
+Partitioning graphs of supply and demand
@@ Property / cites work: Partitioning graphs of supply and demand / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Approximation Scheme for the Multiple Knapsack Problem
+Normal rank
@@ Property / cites work @@
+Q4298260
@@ Property / cites work: Q4298260 / rank @@
+Normal rank