Pages that link to "Item:Q2420650"

The following pages link to Local search approximation algorithms for the \(k\)-means problem with penalties (Q2420650):

Displaying 16 items.

• An improved Bregman \(k\)-means++ algorithm via local search (Q2019501) (← links)
• Improved approximation for prize-collecting red-blue median (Q2043014) (← links)
• The bi-criteria seeding algorithms for two variants of \(k\)-means problem (Q2082186) (← links)
• Improved local search algorithms for Bregman \(k\)-means and its variants (Q2084627) (← links)
• Approximation algorithm for spherical \(k\)-means problem with penalty (Q2086912) (← links)
• Approximation algorithms for the capacitated correlation clustering problem with penalties (Q2099670) (← links)
• Approximation algorithm for the capacitated correlation clustering problem with penalties (Q2151358) (← links)
• An exact algorithm for stable instances of the \(k\)-means problem with penalties in fixed-dimensional Euclidean space (Q2165794) (← links)
• An improved approximation algorithm for the \(k\)-means problem with penalties (Q2327099) (← links)
• Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics (Q4634032) (← links)
• An improved primal-dual approximation algorithm for the <i>k</i>-means problem with penalties (Q5048009) (← links)
• The Parallel Seeding Algorithm for k-Means Problem with Penalties (Q5149519) (← links)
• Approximation Algorithms for Spherical k-Means Problem with Penalties Using Local Search Techniques (Q6053502) (← links)
• The provably good parallel seeding algorithms for the <i>k</i>‐means problem with penalties (Q6092504) (← links)
• Local search yields a PTAS for fixed-dimensional \(k\)-means problem with penalties (Q6566778) (← links)
• Approximation algorithms for robust clustering problems using local search techniques (Q6636083) (← links)