Approximating a Finite Metric by a Small Number of Tree Metrics

  • S. P LOTKIN
  • Published 1998

Abstract

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)

1 Figure or Table

Topics

  • Presentations referencing similar topics