Pages that link to "Item:Q1869938"

The following pages link to A constant-factor approximation algorithm for the \(k\)-median problem (Q1869938):

Displaying 50 items.

• Clustering through continuous facility location problems (Q346248) (← links)
• On generalizations of network design problems with degree bounds (Q378106) (← links)
• On the linear relaxation of the \(p\)-median problem (Q429694) (← links)
• Comparison and analysis of ten static heuristics-based Internet data replication techniques (Q436652) (← links)
• Data stability in clustering: a closer look (Q465252) (← links)
• Capacitated domination problem (Q534769) (← links)
• Multi-facility ordered median problems in directed networks (Q545449) (← links)
• Approximation algorithms for min-sum \(k\)-clustering and balanced \(k\)-median (Q666661) (← links)
• Local search algorithms for the red-blue median problem (Q692631) (← links)
• Generalized \(k\)-means in GLMs with applications to the outbreak of COVID-19 in the United States (Q830116) (← links)
• Parameterized complexity of categorical clustering with size constraints (Q832880) (← links)
• Centrality of trees for capacitated \(k\)-center (Q896276) (← links)
• On the \(p\)-median polytope of \(Y\)-free graphs (Q951093) (← links)
• The reverse greedy algorithm for the metric k-median problem (Q1045901) (← links)
• Approximation algorithms for geometric median problems (Q1209349) (← links)
• A constant-factor approximation algorithm for the \(k\)-MST problem (Q1305925) (← links)
• An approximation algorithm for the \(k\)-median problem with uniform penalties via pseudo-solution (Q1630998) (← links)
• Information-theoretic feature selection with discrete \(k\)-median clustering (Q1639220) (← links)
• A bicriteria approximation algorithm for the \(k\)-center and \(k\)-median problems (Q1644926) (← links)
• A local search approximation algorithm for the uniform capacitated \(k\)-facility location problem (Q1702823) (← links)
• Learning mixtures of separated nonspherical Gaussians (Q1774210) (← links)
• Maximum gradient embeddings and monotone clustering (Q1945290) (← links)
• Most recent changepoint detection in censored panel data (Q1995859) (← links)
• Approximation algorithms for the lower-bounded \(k\)-median and its generalizations (Q2019514) (← links)
• Approximating the \(\tau\)-relaxed soft capacitated facility location problem (Q2023133) (← links)
• Approximation algorithms for the lower-bounded knapsack median problem (Q2039651) (← links)
• Lossy kernelization of same-size clustering (Q2097218) (← links)
• Improved approximation algorithms for solving the squared metric \(k\)-facility location problem (Q2110368) (← links)
• The distance-constrained matroid median problem (Q2182102) (← links)
• The median routing problem for simultaneous planning of emergency response and non-emergency jobs (Q2183877) (← links)
• The capacity constrained facility location problem (Q2212775) (← links)
• Approximation algorithms for spherical \(k\)-means problem using local search scheme (Q2220852) (← links)
• Mobile facility location: combinatorial filtering via weighted occupancy (Q2251136) (← links)
• Facility location problems: a parameterized view (Q2275913) (← links)
• Partial recovery bounds for clustering with the relaxed \(K\)-means (Q2319817) (← links)
• Probabilistic \(k\)-median clustering in data streams (Q2344214) (← links)
• Clustering with or without the approximation (Q2377383) (← links)
• A new efficient algorithm based on DC programming and DCA for clustering (Q2385500) (← links)
• An approximation algorithm for the \(p\)-hub median problem (Q2413170) (← links)
• A note on scenario reduction for two-stage stochastic programs (Q2467443) (← links)
• Incremental medians via online bidding (Q2482726) (← links)
• Approximating \(k\)-median via pseudo-approximation (Q2805513) (← links)
• A constant-factor approximation algorithm for the \(k\)-median problem (extended abstract) (Q2819529) (← links)
• Interactive Clustering of Linear Classes and Cryptographic Lower Bounds (Q2835625) (← links)
• Clustering for metric and nonmetric distance measures (Q2930341) (← links)
• An Approximation Algorithm for the k-Median Problem with Uniform Penalties via Pseudo-Solutions (Q2958344) (← links)
• An Approximation Algorithm for the Continuous <i>k</i>-Medians Problem in a Convex Polygon (Q2962556) (← links)
• Locating Depots for Capacitated Vehicle Routing (Q3088097) (← links)
• Analysis of a local search algorithm for the k-facility location problem (Q3186668) (← links)
• Core-Sets: Updated Survey (Q3297370) (← links)