Polynomial Time Approximation Schemes for Geometric k-Clustering


The Johnson-Lindenstrauss lemma states that n points in a high dimensional Hilbert space can be embedded with small distortion of the distances into an O(logn) dimensional space by applying a random linear transformation. We show that similar (though weaker) properties hold for certain random linear transformations over the Hamming cube. We use these… (More)
DOI: 10.1109/SFCS.2000.892123


  • Presentations referencing similar topics