Faster geometric \(k\)-point MST approximation (Q1370933): Difference between revisions

@@ Property / cites work @@
+Q4395317
@@ Property / cites work: Q4395317 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4234074
@@ Property / cites work: Q4234074 / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel construction of quadtrees and quality triangulations
+Normal rank
@@ Property / cites work @@
+Q4234076
@@ Property / cites work: Q4234076 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4228499
@@ Property / cites work: Q4228499 / rank @@
+Normal rank
@@ Property / cites work @@
+Static and dynamic algorithms for k-point clustering problems
+Normal rank
@@ Property / cites work @@
+Iterated nearest neighbors and finding minimal polytopes
+Normal rank
@@ Property / cites work @@
+An <i>O</i>(log <i>k</i>) approximation algorithm for the <i>k</i> minimum spanning tree problem in the plane
+Normal rank
@@ Property / cites work @@
+Steiner Minimal Trees
@@ Property / cites work: Steiner Minimal Trees / 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
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0925-7721(96)00021-1
+Normal rank
@@ Property / OpenAlex ID @@
+W2010303431
@@ Property / OpenAlex ID: W2010303431 / rank @@
+Normal rank