Pages that link to "Item:Q1702850"

The following pages link to Faster algorithms for the constrained \(k\)-means problem (Q1702850):

Displaying 19 items.

• Order-constrained solutions in \(K\)-means clustering: even better than being globally optimal (Q998835) (← links)
• Faster balanced clusterings in high dimension (Q2006774) (← links)
• An approximation algorithm for the uniform capacitated \(k\)-means problem (Q2082194) (← links)
• Lossy kernelization of same-size clustering (Q2097218) (← links)
• Approximation and complexity of the capacitated geometric median problem (Q2117109) (← links)
• A unified framework for clustering constrained data without locality property (Q2300724) (← links)
• Improved PTAS for the constrained \(k\)-means problem (Q2424715) (← links)
• Nearly tight bounds on the price of explainability for the \(k\)-center and the maximum-spacing clustering problems (Q2686110) (← links)
• Tight FPT approximation for constrained \(k\)-center and \(k\)-supplier (Q2699973) (← links)
• Some Estimates on the Discretization of Geometric Center-Based Problems in High Dimensions (Q4965103) (← links)
• (Q5718893) (← links)
• Algorithms and Computation (Q5897934) (← links)
• A unified framework of FPT approximation algorithms for clustering problems (Q6065394) (← links)
• FPT Approximation for Constrained Metric k-Median/Means (Q6089659) (← links)
• On coresets for fair clustering in metric and Euclidean spaces and their applications (Q6152182) (← links)
• Tight FPT approximation for socially fair clustering (Q6161442) (← links)
• Lossy kernelization of same-size clustering (Q6174654) (← links)
• A generalized \(k\)-means problem for clustering and an ADMM-based \(k\)-means algorithm (Q6536959) (← links)
• Connected \(k\)-center and \(k\)-diameter clustering (Q6623593) (← links)