Pages that link to "Item:Q5175948"

The following pages link to Approximating min-sum <i>k</i> -clustering in metric spaces (Q5175948):

Displaying 17 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)
• Small space representations for metric min-sum \(k\)-clustering and their applications (Q968274) (← links)
• Clustering to minimize the sum of cluster diameters (Q1887718) (← links)
• Maximum gradient embeddings and monotone clustering (Q1945290) (← 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)
• Sublinear‐time approximation algorithms for clustering via random sampling (Q3419620) (← links)
• Approximation Algorithms for Min-Sum k-Clustering and Balanced k-Median (Q3448778) (← links)
• Advances in metric embedding theory (Q5894374) (← links)
• A tight bound on approximating arbitrary metrics by tree metrics (Q5917578) (← links)