Fast approximations for sums of distances, clustering and the Fermat-Weber problem (Q1869747): Difference between revisions

@@ Property / cites work @@
+The algebraic degree of geometric optimization problems
+Normal rank
@@ Property / cites work @@
+Q3024790
@@ Property / cites work: Q3024790 / rank @@
+Normal rank
@@ Property / cites work @@
+The rectilinear distance minisum problem with minimum distance constraints:
+Normal rank
@@ Property / cites work @@
+Algebraic optimization: The Fermat-Weber location problem
+Normal rank
@@ Property / cites work @@
+Efficient Algorithms for the Capacitated 1-Median Problem
+Normal rank
@@ Property / cites work @@
+Robust distance-based clustering with applications to spatial data mining
+Normal rank
@@ Property / cites work @@
+Sublinear time algorithms for metric space problems
+Normal rank
@@ Property / cites work @@
+Improved algorithms for placing undesirable facilities
+Normal rank
@@ Property / cites work @@
+Finding Groups in Data
@@ Property / cites work: Finding Groups in Data / rank @@
+Normal rank
@@ Property / cites work @@
+Two Notes on Notation
@@ Property / cites work: Two Notes on Notation / rank @@
+Normal rank
@@ Property / cites work @@
+Q5669010
@@ Property / cites work: Q5669010 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of facets (and some facets of complexity)
+Normal rank
@@ Property / cites work @@
+Q3992847
@@ Property / cites work: Q3992847 / rank @@
+Normal rank
@@ Property / cites work @@
+On Constructing Minimum Spanning Trees in <i>k</i>-Dimensional Spaces and Related Problems
+Normal rank