A constant-factor approximation algorithm for the \(k\)-MST problem (Q1305925): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1006/jcss.1997.1542
+Normal rank
@@ Property / OpenAlex ID @@
+W1575625195
@@ Property / OpenAlex ID: W1575625195 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4234074
@@ Property / cites work: Q4234074 / rank @@
+Normal rank
@@ Property / cites work @@
+The prize collecting traveling salesman problem
@@ Property / cites work: The prize collecting traveling salesman problem / rank @@
+Normal rank
@@ Property / cites work @@
+The minimum latency problem
@@ Property / cites work: The minimum latency problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4234076
@@ Property / cites work: Q4234076 / rank @@
+Normal rank
@@ Property / cites work @@
+Weighted <i>k</i>‐cardinality trees: Complexity and polyhedral structure
+Normal rank
@@ Property / cites work @@
+Q4875179
@@ Property / cites work: Q4875179 / rank @@
+Normal rank
@@ Property / cites work @@
+A General Approximation Technique for Constrained Forest Problems
+Normal rank
@@ Property / cites work @@
+Q3792511
@@ Property / cites work: Q3792511 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4875213
@@ Property / cites work: Q4875213 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3128917
@@ Property / cites work: Q3128917 / rank @@
+Normal rank