Pages that link to "Item:Q666661"

The following pages link to Approximation algorithms for min-sum \(k\)-clustering and balanced \(k\)-median (Q666661):

Displaying 10 items.

• A constant-factor approximation algorithm for the \(k\)-median problem (Q1869938) (← links)
• Faster balanced clusterings in high dimension (Q2006774) (← links)
• On parameterized approximation algorithms for balanced clustering (Q2111529) (← links)
• Minimization of Gini impurity: NP-completeness and approximation algorithm via connections with the \(k\)-means problem (Q2132392) (← links)
• Approximation Algorithms for Aversion k-Clustering via Local k-Median (Q4598205) (← links)
• Approximation Algorithms for the Capacitated Min–Max Correlation Clustering Problem (Q6053495) (← links)
• Approximation algorithms for fair \(k\)-median problem without fairness violation (Q6185845) (← links)
• Squarepants in a tree, sum of subtree clustering and hyperbolic pants decomposition (Q6486923) (← links)
• A PTAS framework for clustering problems in doubling metrics (Q6591490) (← links)
• Approximation schemes for Min-Sum \(k\)-Clustering (Q6670503) (← links)