Search Results for author:
Found 4 papers, 0 papers with code
Why You Should Charge Your Friends for Borrowing Your Stuff
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.
A PTAS for $\ell_p$-Low Rank Approximation
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)}$.
On Approximability of Clustering Problems Without Candidate Centers
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.
Johnson Coverage Hypothesis: Inapproximability of k-means and k-median in L_p metrics
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.
