On improved bounds for bounded degree spanning trees for points in arbitrary dimension (Q2250052): Difference between revisions

@@ Property / OpenAlex ID @@
+W3101747863
@@ Property / OpenAlex ID: W3101747863 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.2661
@@ Property / arXiv ID: 1305.2661 / rank @@
+Normal rank
@@ Property / cites work @@
+On two geometric problems related to the travelling salesman problem
+Normal rank
@@ Property / cites work @@
+Approximating minimum bounded degree spanning trees to within one of optimal
+Normal rank
@@ Property / cites work @@
+A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees
+Normal rank
@@ Property / cites work @@
+Low degree spanning trees of small weight
@@ Property / cites work: Low degree spanning trees of small weight / rank @@
+Normal rank
@@ Property / cites work @@
+Euclidean bounded-degree spanning tree ratios
@@ Property / cites work: Euclidean bounded-degree spanning tree ratios / rank @@
+Normal rank
@@ Property / cites work @@
+Transitions in geometric minimum spanning trees
@@ Property / cites work: Transitions in geometric minimum spanning trees / rank @@
+Normal rank
@@ Property / cites work @@
+Optimizing the Arrangement of Points on the Unit Sphere
+Normal rank