On the complexity of graph tree partition problems. (Q1421460): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Balanced spanning forests and trees
@@ Property / cites work: Balanced spanning forests and trees / rank @@
+Normal rank
@@ Property / cites work @@
+Heuristics with Constant Error Guarantees for the Design of Tree Networks
+Normal rank
@@ Property / cites work @@
+Q3312256
@@ Property / cites work: Q3312256 / rank @@
+Normal rank
@@ Property / cites work @@
+The Rectilinear Steiner Tree Problem is $NP$-Complete
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+A General Approximation Technique for Constrained Forest Problems
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Min–Max Tree Partition
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for minimum tree partition
+Normal rank
@@ Property / cites work @@
+An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+A greedy heuristic for a minimum-weight forest problem
+Normal rank
@@ Property / cites work @@
+On the shortest spanning subtree of a graph and the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+The complexity of the capacitated tree problem
@@ Property / cites work: The complexity of the capacitated tree problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4111952
@@ Property / cites work: Q4111952 / rank @@
+Normal rank
@@ Property / cites work @@
+A heuristic algorithm for the mini-max spanning forest problem
+Normal rank
@@ Property / cites work @@
+A branch-and-bound algorithm for the mini-max spanning forest problem
+Normal rank