On hierarchical diameter-clustering and the supplier problem (Q839643): Difference between revisions

@@ Property / describes a project that uses @@
+clusfind
@@ Property / describes a project that uses: clusfind / 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/s00224-009-9186-6
+Normal rank
@@ Property / OpenAlex ID @@
+W1981622620
@@ Property / OpenAlex ID: W1981622620 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4867182
@@ Property / cites work: Q4867182 / rank @@
+Normal rank
@@ Property / cites work @@
+Incremental Clustering and Dynamic Information Retrieval
+Normal rank
@@ Property / cites work @@
+Oblivious Medians Via Online Bidding
@@ Property / cites work: Oblivious Medians Via Online Bidding / rank @@
+Normal rank
@@ Property / cites work @@
+Performance guarantees for hierarchical clustering
+Normal rank
@@ Property / cites work @@
+Clustering to minimize the maximum intercluster distance
+Normal rank
@@ Property / cites work @@
+A Best Possible Heuristic for the <i>k</i>-Center Problem
+Normal rank
@@ Property / cites work @@
+Q3994557
@@ Property / cites work: Q3994557 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Groups in Data
@@ Property / cites work: Finding Groups in Data / rank @@
+Normal rank
@@ Property / cites work @@
+A general approach for incremental approximation and hierarchical clustering
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:839643