Pages that link to "Item:Q2218871"

The following pages link to A constant FPT approximation algorithm for hard-capacitated \(k\)-means (Q2218871):

Displaying 10 items.

• An approximation algorithm for the uniform capacitated \(k\)-means problem (Q2082194) (← links)
• Approximation algorithms for the capacitated correlation clustering problem with penalties (Q2099670) (← links)
• On parameterized approximation algorithms for balanced clustering (Q2111529) (← links)
• To close is easier than to open: dual parameterization to \(k\)-median (Q2117693) (← links)
• Approximation algorithm for the capacitated correlation clustering problem with penalties (Q2151358) (← links)
• Algorithms and Computation (Q5897934) (← links)
• Approximation Algorithms for the Capacitated Min–Max Correlation Clustering Problem (Q6053495) (← links)
• Effective Heuristic Techniques for Combined Robust Clustering Problem (Q6053497) (← links)
• FPT Approximation for Constrained Metric k-Median/Means (Q6089659) (← links)
• A semi brute-force search approach for (balanced) clustering (Q6185939) (← links)