Date post: | 01-Apr-2015 |
Category: |
Documents |
Upload: | kelsie-whitmill |
View: | 213 times |
Download: | 0 times |
Igor BallaREU DIMACS
2010
Metric Spaces
1. 2. 3. 4.
Graph Metrics
Metric Embedding
Approximating Cycle Metrics
Probabilistic Approximations by Tree Metrics
Directions for Further Research
1. Bartal, Y. 1996. Probabilistic approximations of metric spaces and its algorithmic applications. In Proceedings of the 37th Annual Symposium on Foundations of Computer Science (October 14-16, 1996). FOCS. IEEE Computer Society, Washington, DC, 184
2. Fakcharoenphol, J., Rao, S., Talwar, K. 2004. A tight bound on approximating arbitrary metrics by tree metrics. J. Comput. Syst. Sci. 69, 3 (Nov. 2004), 485-497.
3. Karp, R. 1989. A 2k-competitive algorithm for the circle. Manuscript (August 1989)
References