Euclidean chains and their shortcuts (Q391221): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2012.03.021
+Normal rank
@@ Property / OpenAlex ID @@
+W2155175290
@@ Property / OpenAlex ID: W2155175290 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for Reporting and Counting Geometric Intersections
+Normal rank
@@ Property / cites work @@
+Comments on “algorithms for reporting and counting geometric intersections”
+Normal rank
@@ Property / cites work @@
+Facility location and the geometric minimum-diameter spanning tree.
+Normal rank
@@ Property / cites work @@
+Minimum Diameter Spanning Trees and Related Problems
+Normal rank
@@ Property / cites work @@
+Q3992847
@@ Property / cites work: Q3992847 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing a \((1+\varepsilon)\)-approximate geometric minimum-diameter spanning tree
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:391221