Author

Satish Rao

Created by Alysson Bolognesi Prado at 2019-03-28 09:46:21.0.

Simplified Graph of Associations

Word Cloud

Could you solve a captcha to retrieve Renata Cristina Barros Madeo's Lattes?

Cole aqui o código fonte do lattes da pessoa:

Sim, eu sei, isso é feio, é horrível. Mas o Lattes mudou para o recaptcha, e agora não sei mais como contornar.

Yes

Why?

Publications

A new approach to computing maximum flows using electrical flows

Approximation schemes for Euclidean k-medians and related problems

A tight bound on approximating arbitrary metrics by tree metrics

Beyond the flow decomposition barrier

Small distortion and volume preserving embeddings for planar and Euclidean metrics

Published At

Proceedings of the fifteenth annual symposium on Computational geometry - SCG ’99

Proceedings of the thirty-fifth ACM symposium on Theory of computing - STOC ’03

Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC ’98

Journal of the ACM

Proceedings of the 45th annual ACM symposium on Symposium on theory of computing - STOC ’13

Co-Authors

Jittat Fakcharoenphol

Referenced By

Bypassing the embedding

Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems

Metric embedding via shortest path decompositions

A new approach to computing maximum flows using electrical flows