10 citations · 21 across the 15 of their papers we have counts for
4 papers · 1 filter
A Better-than-2 Approximation for k-Median Part I: The Power of General Bids
Rares-Darius Buhai, Vincent Cohen-Addad, Henry Fleischmann +6
The Greedy algorithm of Jain, Mahdian, Markakis, Saberi, and Vazirani was the best Lagrangian-multiplier-preserving (LMP) approximation algorithm for facility location, and thus th…
A Better-than- Approximation for -Median Part II: Stable Instances
Rares-Darius Buhai, Vincent Cohen-Addad, Henry Fleischmann +6
We consider the -median problem on general metric spaces, subject to the condition that the instances are -stable (i.e., the optimal solution using centers has a cost a…
Spectral Dual Fitting for -Means
Aditya Anand, Moses Charikar, Vincent Cohen-Addad +5
We give a new dual fitting algorithm which gives improved approximation ratios of and for -Means in (high-dimensional) Euclidean and genera…
An Improved Greedy Approximation for (Metric) -Means
Moses Charikar, Vincent Cohen-Addad, Ruiquan Gao +3
Clustering is a basic task in data analysis and machine learning, and the optimization of clustering objectives are well-studied optimization problems; amongst these, the -Means…