PARTITIONING TREES OF SUPPLY AND DEMAND (Q5462677): Difference between revisions

@@ Property / author @@
-Takao Nishizeki
@@ Property / author: Takao Nishizeki / rank @@
-Normal rank
@@ Property / author @@
+Takao Nishizeki
@@ Property / author: Takao Nishizeki / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of partitioning graphs into connected subgraphs
+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 @@
+A linear-time algorithm for four-partitioning four-connected planar graphs
+Normal rank
@@ Property / cites work @@
+An exact algorithm for large multiple knapsack problems
+Normal rank
@@ Property / cites work @@
+Max-Min Tree Partitioning
@@ Property / cites work: Max-Min Tree Partitioning / rank @@
+Normal rank