Pages that link to "Item:Q2805513"

The following pages link to Approximating \(k\)-median via pseudo-approximation (Q2805513):

Displaying 48 items.

• A lower bound for metric 1-median selection (Q340556) (← links)
• An approximation algorithm for the \(k\)-median problem with uniform penalties via pseudo-solution (Q1630998) (← links)
• A local search approximation algorithm for the uniform capacitated \(k\)-facility location problem (Q1702823) (← links)
• Faster balanced clusterings in high dimension (Q2006774) (← links)
• Approximation algorithms for the lower-bounded \(k\)-median and its generalizations (Q2019514) (← links)
• Approximation algorithms for the lower-bounded knapsack median problem (Q2039651) (← links)
• An approximation algorithm for stochastic multi-level facility location problem with soft capacities (Q2082185) (← 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)
• Problem-based optimal scenario generation and reduction in stochastic programming (Q2118075) (← links)
• Scenario reduction revisited: fundamental limits and guarantees (Q2118076) (← links)
• An improved approximation algorithm for capacitated correlation clustering problem (Q2149853) (← links)
• An improved approximation algorithm for squared metric \(k\)-facility location (Q2150578) (← links)
• Improved parameterized approximation for balanced \(k\)-median (Q2150584) (← links)
• An improved \((1+1)\) evolutionary algorithm for \(k\)-Median clustering problem with performance guarantee (Q2164835) (← links)
• Approximation algorithms for clustering with dynamic points (Q2168849) (← links)
• The distance-constrained matroid median problem (Q2182102) (← links)
• Approximation algorithms for spherical \(k\)-means problem using local search scheme (Q2220852) (← links)
• Iterative partial rounding for vertex cover with hard capacities (Q2223692) (← links)
• The ordered \(k\)-median problem: surrogate models and approximation algorithms (Q2316614) (← links)
• Local search approximation algorithms for the \(k\)-means problem with penalties (Q2420650) (← links)
• Solving the \(p\)-median problem on regular and lattice networks (Q2664388) (← links)
• On clustering with discounts (Q2671820) (← links)
• Better guarantees for \(k\)-median with service installation costs (Q2672628) (← links)
• An Approximation Algorithm for the k-Median Problem with Uniform Penalties via Pseudo-Solutions (Q2958344) (← links)
• Kantorovich–Rubinstein Distance Minimization: Application to Location Problems (Q3296381) (← links)
• Approximation Algorithms for Distributed Multi-robot Coverage in Non-convex Environments (Q3381981) (← links)
• Finding the Median (Obliviously) with Bounded Space (Q3448777) (← links)
• A Branch Decomposition Algorithm for the <i>p</i>-Median Problem (Q4599316) (← links)
• Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics (Q4634032) (← links)
• (Q4675629) (← links)
• (Q5002778) (← links)
• (Q5091192) (← links)
• Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual Algorithms (Q5117377) (← links)
• An Improved Approximation for <i>k</i>-median, and Positive Correlation in Budgeted Optimization (Q5363039) (← links)
• Approximating k-median via pseudo-approximation (Q5495862) (← links)
• Hidden Integrality and Semirandom Robustness of SDP Relaxation for Sub-Gaussian Mixture Model (Q5868965) (← links)
• (Q5874528) (← links)
• On the cost of essentially fair clusterings (Q5875470) (← links)
• A local search approximation algorithm for a squared metric \(k\)-facility location problem (Q5916060) (← links)
• A unified framework of FPT approximation algorithms for clustering problems (Q6065394) (← links)
• Improved approximations for Euclidean <i>k</i> -means and <i>k</i> -median, via nested quasi-independent sets (Q6083617) (← links)
• FPT Approximation for Constrained Metric k-Median/Means (Q6089659) (← links)
• Lossy kernelization of same-size clustering (Q6174654) (← links)
• An improved approximation algorithm for the capacitated correlation clustering problem (Q6610093) (← links)
• A local search algorithm for radius-constrained \(k\)-median (Q6636081) (← links)
• Approximation algorithms for robust clustering problems using local search techniques (Q6636083) (← links)