Y. Bartal, On approximating arbitrary metrices by tree metrics, Proceedings of the 13th Annual ACM Symposium on Theory of Computing, pp. 161-168, 1998. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Finite Metric Spaces - Combinatorics, Geometry and Algorithms - Linial (2002) (2 citations) (Correct)
....that bw(G) O( G) log c n) His paper gives c = 3:5 which was later [DV99] improved to c = 3. Open Problem 2. Is it true that bw(G) O( G) log n) It is not hard to see that this bound would be tight for expanders. 4. 3 Bartal s method The following general structure theorem of Bartal [Bar98] has numerous algorithmic applications: Theorem 9. For every nite metric space (X; d) there is a collection of trees fT i j i 2 Ig, each of which has X as its set of leaves, and positive weights fp i j i 2 Ig with I p i = 1. Each of these tree metrics dominates d, i.e. dist T i (x; y) d(x; ....
Yair Bartal. On approximating arbitrary metrices by tree metrics. In STOC '98 (Dallas, TX), pages 161-168. ACM, New York, 1998.
Collective Tree Spanners of Graphs - Dragan, Yan, Lomonosov (2004) (Correct)
No context found.
Y. Bartal, On approximating arbitrary metrices by tree metrics, Proceedings of the 13th Annual ACM Symposium on Theory of Computing, pp. 161-168, 1998.
Approximate Distance Oracles - Thorup, Zwick (2001) (33 citations) (Correct)
No context found.
Y. Bartal. On approximating arbitrary metrices by tree metrics. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing, Dallas, Texas, pages 161--168, 1999. 20
Approximate Distance Oracles - Thorup, Zwick (2001) (33 citations) (Correct)
No context found.
Y. Bartal. On approximating arbitrary metrices by tree metrics. In Proc. 30th STOC, pages 161--168, 1999.
Approximate Distance Oracles - Mikkel Thorup Uri (2001) (33 citations) (Correct)
No context found.
Y. Bartal. On approximating arbitrary metrices by tree metrics. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing, Dallas, Texas, pages 161--168, 1999.
Derandomized Dimensionality Reduction with Applications - Engebretsen, Indyk, O'Donnell (2002) (6 citations) (Correct)
No context found.
Y. Bartal. On approximating arbitrary metrices by tree metrics. Symposium on Theory of Computing, 1998.
Approximation Algorithms for the Single-Warehouse.. - Shen, Simchi-Levi, Teo (Correct)
No context found.
Bartal, Y. (1998) On Approximating Arbitrary Metrices by Tree Metrics. Proceedings of the 38th Annual Symposium on Foundations of Computer Science, ACM, 161-168.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC