Maximizing the ratio of cluster split to cluster diameter without and with cardinality constraints
From MaRDI portal
Publication:2072077
DOI10.1016/j.tcs.2021.12.015OpenAlexW4200279121MaRDI QIDQ2072077
Publication date: 1 February 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2021.12.015
Cites Work
- Unnamed Item
- Unnamed Item
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Analysis of agglomerative clustering
- On minimum sum of radii and diameters clustering
- Minimum sum of diameters clustering
- Maximum sum-of-splits clustering
- A simple heuristic for the p-centre problem
- On hierarchical diameter-clustering and the supplier problem
- On metric clustering to minimize the sum of radii
- Clustering to minimize the maximum intercluster distance
- The weighted sum of split and diameter clustering
- Easy and hard bottleneck location problems
- Optimal packing and covering in the plane are NP-complete
- Minimizing the sum of diameters efficiently
- Splitting an ordering into a partition to minimize diameter
- \(k\)-center problems with minimum coverage
- Performance guarantees for hierarchical clustering
- Clustering to minimize the sum of cluster diameters
- Hierarchical clustering schemes
- On the Complexity of Some Common Geometric Location Problems
- The bottleneck problem with minimum quantity commitments
- A Best Possible Heuristic for the k-Center Problem
- Bicriterion Cluster Analysis
- An efficient algorithm for a complete link method
- How to Allocate Network Centers
- The Capacitated K-Center Problem
- Approximate Hierarchical Clustering via Sparsest Cut and Spreading Metrics
- Incremental Clustering and Dynamic Information Retrieval
- Dynamic Digraph Connectivity Hastens Minimum Sum-of-Diameters Clustering
- Hierarchical Clustering
- Hierarchical Clustering better than Average-Linkage
- A cost function for similarity-based hierarchical clustering
- Centrality of Trees for Capacitated k-Center
This page was built for publication: Maximizing the ratio of cluster split to cluster diameter without and with cardinality constraints