Approximation algorithm for the balanced 2-connected \(k\)-partition problem (Q896161): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2015.02.001
@@ Property / DOI: 10.1016/j.tcs.2015.02.001 / rank @@
-Normal rank
@@ Property / cites work @@
+Q3097395
@@ Property / cites work: Q3097395 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5387695
@@ Property / cites work: Q5387695 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the Maximally Balanced Connected Partition Problem in graphs
+Normal rank
@@ Property / cites work @@
+On the complexity of partitioning graphs into connected subgraphs
+Normal rank
@@ Property / cites work @@
+On the approximability of some Maximum Spanning Tree Problems
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4168622
@@ Property / cites work: Q4168622 / rank @@
+Normal rank
@@ Property / cites work @@
+A homology theory for spanning tress of a graph
@@ Property / cites work: A homology theory for spanning tress of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Most uniform path partitioning and its use in image processing
+Normal rank
@@ Property / cites work @@
+Clustering on trees
@@ Property / cites work: Clustering on trees / rank @@
+Normal rank
@@ Property / cites work @@
+FULLY POLYNOMIAL-TIME APPROXIMATION SCHEMES FOR THE MAX–MIN CONNECTED PARTITION PROBLEM ON INTERVAL GRAPHS
+Normal rank
@@ Property / cites work @@
+Approximation Algorithm for the Balanced 2-Connected Bipartition Problem
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2015.02.001
@@ Property / DOI: 10.1016/J.TCS.2015.02.001 / rank @@
+Normal rank