Bartal [4, 5] gave a randomized polynomial time algorithm that given any n point metric G, constructs a tree T such that the expected stretch (distortion) of any edge is at most O(logn log logn). His result has found several applications and in particular has resulted in approximation algorithms for many graph optimization problems. However approximation… (More)

### Presentations referencing similar topics