Static and dynamic algorithms for k-point clustering problems (Q5060119): Difference between revisions

@@ Property / author @@
-Hans-Peter Lenhof
@@ Property / author: Hans-Peter Lenhof / rank @@
-Normal rank
@@ Property / author @@
-Christian Schwarz
@@ Property / author: Christian Schwarz / rank @@
-Normal rank
@@ Property / author @@
-Michiel H. M. Smid
@@ Property / author: Michiel H. M. Smid / rank @@
-Normal rank
@@ Property / author @@
+Hans-Peter Lenhof
@@ Property / author: Hans-Peter Lenhof / rank @@
+Normal rank
@@ Property / author @@
+Christian Schwarz
@@ Property / author: Christian Schwarz / rank @@
+Normal rank
@@ Property / author @@
+Michiel H. M. Smid
@@ Property / author: Michiel H. M. Smid / rank @@
+Normal rank
@@ 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.1007/3-540-57155-8_254
+Normal rank
@@ Property / OpenAlex ID @@
+W1596202017
@@ Property / OpenAlex ID: W1596202017 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding k points with minimum diameter and related problems
+Normal rank
@@ Property / cites work @@
+Decomposable searching problems
@@ Property / cites work: Decomposable searching problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q3140402
@@ Property / cites work: Q3140402 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4230362
@@ Property / cites work: Q4230362 / rank @@
+Normal rank
@@ Property / cites work @@
+Maintaining the minimal distance of a point set in polylogarithmic time
+Normal rank