A tight bound on approximating arbitrary metrics by tree metrics
Proceedings of the thirty-fifth ACM symposium on Theory of computing - STOC ’03
Kunal Talwar
Satish Rao
Bypassing the embedding