Pages that link to "Item:Q5175948"
From MaRDI portal
The following pages link to Approximating min-sum <i>k</i> -clustering in metric spaces (Q5175948):
Displaying 28 items.
- Data stability in clustering: a closer look (Q465252) (← links)
- Approximating \(k\)-generalized connectivity via collapsing HSTs (Q491201) (← links)
- Capacitated domination problem (Q534769) (← links)
- Integer point sets minimizing average pairwise \(L_{1}\) distance: What is the optimal shape of a town? (Q621921) (← links)
- Approximation algorithms for min-sum \(k\)-clustering and balanced \(k\)-median (Q666661) (← links)
- Center-based clustering under perturbation stability (Q763489) (← links)
- An improved approximation algorithm for the metric maximum clustering problem with given cluster sizes (Q844164) (← links)
- Small space representations for metric min-sum \(k\)-clustering and their applications (Q968274) (← links)
- Min sum clustering with penalties (Q976485) (← links)
- Approximation algorithms for min-sum \(p\)-clustering (Q1281390) (← links)
- Approximation algorithms for the metric maximum clustering problem with given cluster sizes. (Q1811624) (← links)
- Clustering to minimize the sum of cluster diameters (Q1887718) (← links)
- Maximum gradient embeddings and monotone clustering (Q1945290) (← links)
- Optimising sum-of-squares measures for clustering multisets defined over a metric space (Q2444542) (← links)
- Communication-aware processor allocation for supercomputers: Finding point sets of small average distance (Q2480901) (← links)
- A greedy approximation algorithm for the group Steiner problem (Q2581556) (← links)
- Approximation algorithms for hard capacitated \(k\)-facility location problems (Q2630091) (← links)
- Interactive Clustering of Linear Classes and Cryptographic Lower Bounds (Q2835625) (← links)
- Metric clustering via consistent labeling (Q3002830) (← links)
- Sublinear‐time approximation algorithms for clustering via random sampling (Q3419620) (← links)
- Approximation Algorithms for Min-Sum k-Clustering and Balanced k-Median (Q3448778) (← links)
- Approximate Clustering via Metric Partitioning (Q4636497) (← links)
- Approximation Schemes for Capacitated Clustering in Doubling Metrics (Q5146927) (← links)
- SAHN Clustering in Arbitrary Metric Spaces Using Heuristic Nearest Neighbor Search (Q5746249) (← links)
- Advances in metric embedding theory (Q5894374) (← links)
- A tight bound on approximating arbitrary metrics by tree metrics (Q5917578) (← links)
- Squarepants in a tree, sum of subtree clustering and hyperbolic pants decomposition (Q6486923) (← links)
- Approximation schemes for Min-Sum \(k\)-Clustering (Q6670503) (← links)
