Approximating \(k\)-hop minimum-spanning trees (Q2488210): Difference between revisions

@@ Property / DOI @@
-.1016/j.orl.2004.05.005
@@ Property / DOI: 10.1016/j.orl.2004.05.005 / rank @@
-Normal rank
@@ Property / cites work @@
+A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem
+Normal rank
@@ Property / cites work @@
+Generalized submodular cover problems and applications
+Normal rank
@@ Property / cites work @@
+Q4542533
@@ Property / cites work: Q4542533 / rank @@
+Normal rank
@@ Property / cites work @@
+A tight bound on approximating arbitrary metrics by tree metrics
+Normal rank
@@ Property / cites work @@
+Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
+Normal rank
@@ Property / cites work @@
+Greedy Strikes Back: Improved Facility Location Algorithms
+Normal rank
@@ Property / cites work @@
+Minimum spanning tree with hop restrictions
@@ Property / cites work: Minimum spanning tree with hop restrictions / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the weight of shallow Steiner trees
@@ Property / cites work: Approximating the weight of shallow Steiner trees / rank @@
+Normal rank
@@ Property / cites work @@
+Bicriteria Network Design Problems
@@ Property / cites work: Bicriteria Network Design Problems / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.ORL.2004.05.005
@@ Property / DOI: 10.1016/J.ORL.2004.05.005 / rank @@
+Normal rank