Igor Balla REU DIMACS 2010. Metric Spaces 1. 2. 3. 4.

7
Igor Balla REU DIMACS 2010

Transcript of Igor Balla REU DIMACS 2010. Metric Spaces 1. 2. 3. 4.

Page 1: Igor Balla REU DIMACS 2010. Metric Spaces 1. 2. 3. 4.

Igor BallaREU DIMACS

2010

Page 2: Igor Balla REU DIMACS 2010. Metric Spaces 1. 2. 3. 4.

Metric Spaces

1. 2. 3. 4.

Page 3: Igor Balla REU DIMACS 2010. Metric Spaces 1. 2. 3. 4.

Graph Metrics

Page 4: Igor Balla REU DIMACS 2010. Metric Spaces 1. 2. 3. 4.

Metric Embedding

Page 5: Igor Balla REU DIMACS 2010. Metric Spaces 1. 2. 3. 4.

Approximating Cycle Metrics

Page 6: Igor Balla REU DIMACS 2010. Metric Spaces 1. 2. 3. 4.

Probabilistic Approximations by Tree Metrics

Page 7: Igor Balla REU DIMACS 2010. Metric Spaces 1. 2. 3. 4.

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