A \(2+\varepsilon\) approximation algorithm for the \(k\)-MST problem (Q2492706): Difference between revisions

@@ Property / cites work @@
+When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
+Normal rank
@@ Property / cites work @@
+Q4471278
@@ Property / cites work: Q4471278 / rank @@
+Normal rank
@@ Property / cites work @@
+A 2.5-factor approximation algorithm for the \(k\)-MST problem
+Normal rank
@@ Property / cites work @@
+New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen
+Normal rank
@@ Property / cites work @@
+The minimum latency problem
@@ Property / cites work: The minimum latency problem / rank @@
+Normal rank
@@ Property / cites work @@
+A constant-factor approximation algorithm for the \(k\)-MST problem
+Normal rank
@@ Property / cites work @@
+Weighted <i>k</i>‐cardinality trees: Complexity and polyhedral structure
+Normal rank
@@ Property / cites work @@
+Saving an epsilon
@@ Property / cites work: Saving an epsilon / rank @@
+Normal rank
@@ Property / cites work @@
+An improved approximation ratio for the minimum latency problem
+Normal rank
@@ Property / cites work @@
+A General Approximation Technique for Constrained Forest Problems
+Normal rank
@@ Property / cites work @@
+Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, <i>k</i>-MST, and Related Problems
+Normal rank
@@ Property / cites work @@
+Spanning Trees—Short or Small
@@ Property / cites work: Spanning Trees—Short or Small / rank @@
+Normal rank
@@ Property / cites work @@
+Q4782696
@@ Property / cites work: Q4782696 / rank @@
+Normal rank