Maximizing the ratio of cluster split to cluster diameter without and with cardinality constraints (Q2072077): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2021.12.015
@@ Property / DOI: 10.1016/j.tcs.2021.12.015 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2021.12.015
+Normal rank
@@ Property / OpenAlex ID @@
+W4200279121
@@ Property / OpenAlex ID: W4200279121 / rank @@
+Normal rank
@@ Property / cites work @@
+Analysis of agglomerative clustering
@@ Property / cites work: Analysis of agglomerative clustering / rank @@
+Normal rank
@@ Property / cites work @@
+Splitting an ordering into a partition to minimize diameter
+Normal rank
@@ Property / cites work @@
+Centrality of Trees for Capacitated k-Center
@@ Property / cites work: Centrality of Trees for Capacitated k-Center / rank @@
+Normal rank
@@ Property / cites work @@
+How to Allocate Network Centers
@@ Property / cites work: How to Allocate Network Centers / rank @@
+Normal rank
@@ Property / cites work @@
+On minimum sum of radii and diameters clustering
@@ Property / cites work: On minimum sum of radii and diameters clustering / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate Hierarchical Clustering via Sparsest Cut and Spreading Metrics
+Normal rank
@@ Property / cites work @@
+Hierarchical Clustering better than Average-Linkage
+Normal rank
@@ Property / cites work @@
+Incremental Clustering and Dynamic Information Retrieval
+Normal rank
@@ Property / cites work @@
+Clustering to minimize the sum of cluster diameters
+Normal rank
@@ Property / cites work @@
+Hierarchical Clustering
@@ Property / cites work: Hierarchical Clustering / rank @@
+Normal rank
@@ Property / cites work @@
+On hierarchical diameter-clustering and the supplier problem
+Normal rank
@@ Property / cites work @@
+A cost function for similarity-based hierarchical clustering
+Normal rank
@@ Property / cites work @@
+Performance guarantees for hierarchical clustering
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for a complete link method
@@ Property / cites work: An efficient algorithm for a complete link method / rank @@
+Normal rank
@@ Property / cites work @@
+Bicriterion Cluster Analysis
@@ Property / cites work: Bicriterion Cluster Analysis / rank @@
+Normal rank
@@ Property / cites work @@
+Q2708233
@@ Property / cites work: Q2708233 / rank @@
+Normal rank
@@ Property / cites work @@
+A simple heuristic for the p-centre problem
@@ Property / cites work: A simple heuristic for the p-centre problem / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal packing and covering in the plane are NP-complete
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+On metric clustering to minimize the sum of radii
@@ Property / cites work: On metric clustering to minimize the sum of radii / rank @@
+Normal rank
@@ Property / cites work @@
+Clustering to minimize the maximum intercluster distance
+Normal rank
@@ Property / cites work @@
+Minimum sum of diameters clustering
@@ Property / cites work: Minimum sum of diameters clustering / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum sum-of-splits clustering
@@ Property / cites work: Maximum sum-of-splits clustering / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing the sum of diameters efficiently
@@ Property / cites work: Minimizing the sum of diameters efficiently / rank @@
+Normal rank
@@ Property / cites work @@
+A Best Possible Heuristic for the <i>k</i>-Center Problem
+Normal rank
@@ Property / cites work @@
+Easy and hard bottleneck location problems
@@ Property / cites work: Easy and hard bottleneck location problems / rank @@
+Normal rank
@@ Property / cites work @@
+Hierarchical clustering schemes
@@ Property / cites work: Hierarchical clustering schemes / rank @@
+Normal rank
@@ Property / cites work @@
+The Capacitated <i>K</i>-Center Problem
@@ Property / cites work: The Capacitated <i>K</i>-Center Problem / rank @@
+Normal rank
@@ Property / cites work @@
+On the shortest spanning subtree of a graph and the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+\(k\)-center problems with minimum coverage
@@ Property / cites work: \(k\)-center problems with minimum coverage / rank @@
+Normal rank
@@ Property / cites work @@
+The bottleneck problem with minimum quantity commitments
+Normal rank
@@ Property / cites work @@
+On the Complexity of Some Common Geometric Location Problems
+Normal rank
@@ Property / cites work @@
+Dynamic Digraph Connectivity Hastens Minimum Sum-of-Diameters Clustering
+Normal rank
@@ Property / cites work @@
+The weighted sum of split and diameter clustering
@@ Property / cites work: The weighted sum of split and diameter clustering / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2021.12.015
@@ Property / DOI: 10.1016/J.TCS.2021.12.015 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2072077