Pages that link to "Item:Q5117377"

The following pages link to Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual Algorithms (Q5117377):

Displaying 42 items.

• Approximation algorithms for fuzzy \(C\)-means problem based on seeding method (Q1981782) (← links)
• Approximating the \(\tau\)-relaxed soft capacitated facility location problem (Q2023133) (← links)
• Approximation algorithm for the balanced 2-correlation clustering problem on well-proportional graphs (Q2039649) (← links)
• The spherical \(k\)-means++ algorithm via local search (Q2039652) (← links)
• Local search algorithm for the spherical \(k\)-means problem with outliers (Q2039653) (← links)
• On perturbation resilience of non-uniform \(k\)-center (Q2072096) (← links)
• The approximation algorithm based on seeding method for functional \(k\)-means problem (Q2076447) (← links)
• The bi-criteria seeding algorithms for two variants of \(k\)-means problem (Q2082186) (← links)
• An approximation algorithm for the uniform capacitated \(k\)-means problem (Q2082194) (← links)
• The seeding algorithm for spherical \(k\)-means clustering with penalties (Q2082212) (← links)
• Approximation algorithm for spherical \(k\)-means problem with penalty (Q2086912) (← links)
• Lossy kernelization of same-size clustering (Q2097218) (← links)
• Improved approximation algorithms for solving the squared metric \(k\)-facility location problem (Q2110368) (← links)
• On parameterized approximation algorithms for balanced clustering (Q2111529) (← links)
• A refined approximation for Euclidean \(k\)-means (Q2122798) (← links)
• An improved approximation algorithm for capacitated correlation clustering problem (Q2149853) (← links)
• An improved approximation algorithm for squared metric \(k\)-facility location (Q2150578) (← links)
• Approximation algorithms for two variants of correlation clustering problem (Q2156281) (← links)
• An improved \((1+1)\) evolutionary algorithm for \(k\)-Median clustering problem with performance guarantee (Q2164835) (← links)
• An exact algorithm for stable instances of the \(k\)-means problem with penalties in fixed-dimensional Euclidean space (Q2165794) (← links)
• Quantum algorithms for similarity measurement based on Euclidean distance (Q2208001) (← links)
• A constant FPT approximation algorithm for hard-capacitated \(k\)-means (Q2218871) (← links)
• Polynomial time approximation schemes for clustering in low highway dimension graphs (Q2229951) (← links)
• The seeding algorithm for \(k\)-means problem with penalties (Q2292125) (← links)
• The seeding algorithms for spherical \(k\)-means clustering (Q2307745) (← links)
• Local search approximation algorithms for the \(k\)-means problem with penalties (Q2420650) (← links)
• Improved PTAS for the constrained \(k\)-means problem (Q2424715) (← links)
• On clustering with discounts (Q2671820) (← links)
• Better guarantees for \(k\)-median with service installation costs (Q2672628) (← links)
• A Lottery Model for Center-Type Problems With Outliers (Q4972682) (← links)
• (Q5009501) (← links)
• Simpler and Better Algorithms for Minimum-Norm Load Balancing (Q5075764) (← links)
• Discrete facility location in machine learning (Q5100135) (← links)
• The Parallel Seeding Algorithm for k-Means Problem with Penalties (Q5149519) (← links)
• (Q5214247) (← links)
• Noisy, Greedy and Not so Greedy k-Means++ (Q5874485) (← links)
• (Q5874516) (← links)
• A unified framework of FPT approximation algorithms for clustering problems (Q6065394) (← links)
• Polynomial approximate discretization of geometric centers in high-dimensional Euclidean space (Q6161667) (← links)
• Secure delegated quantum algorithms for solving Mahalanobis distance (Q6167727) (← links)
• Lossy kernelization of same-size clustering (Q6174654) (← links)
• Approximation algorithms for fair \(k\)-median problem without fairness violation (Q6185845) (← links)