Pages that link to "Item:Q2424715"

The following pages link to Improved PTAS for the constrained \(k\)-means problem (Q2424715):

Displaying 10 items.

• Improved analysis of \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems (Q477594) (← links)
• Faster algorithms for the constrained \(k\)-means problem (Q1702850) (← links)
• Improved approximation algorithms for two-stage flowshops scheduling problem (Q2285149) (← links)
• New kernels for several problems on planar graphs (Q2285156) (← links)
• A unified framework for clustering constrained data without locality property (Q2300724) (← links)
• Improved Conic Reformulations for $K$-means Clustering (Q4555446) (← 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)
• A PTAS framework for clustering problems in doubling metrics (Q6591490) (← links)