Search Results for author: Euiwoong Lee

Found 4 papers, 0 papers with code

Johnson Coverage Hypothesis: Inapproximability of k-means and k-median in L_p metrics

no code implementations21 Nov 2021 Vincent Cohen-Addad, Karthik C. S, Euiwoong Lee

We then show that together with generalizations of the embedding techniques introduced by Cohen-Addad and Karthik (FOCS '19), JCH implies hardness of approximation results for k-median and k-means in $\ell_p$-metrics for factors which are close to the ones obtained for general metrics.

On Approximability of Clustering Problems Without Candidate Centers

no code implementations30 Sep 2020 Vincent Cohen-Addad, C. S. Karthik, Euiwoong Lee

In practice and historically, k-means is thought of in a continuous setting, namely where the centers can be located anywhere in the metric space.

A PTAS for $\ell_p$-Low Rank Approximation

no code implementations16 Jul 2018 Frank Ban, Vijay Bhattiprolu, Karl Bringmann, Pavel Kolev, Euiwoong Lee, David P. Woodruff

On the algorithmic side, for $p \in (0, 2)$, we give the first $(1+\epsilon)$-approximation algorithm running in time $n^{\text{poly}(k/\epsilon)}$.

Why You Should Charge Your Friends for Borrowing Your Stuff

no code implementations20 May 2017 Kijung Shin, Euiwoong Lee, Dhivya Eswaran, Ariel D. Procaccia

We consider goods that can be shared with k-hop neighbors (i. e., the set of nodes within k hops from an owner) on a social network.

Cannot find the paper you are looking for? You can Submit a new open access paper.