Author:
Abraham Ittai,Neiman Ofer
Reference12 articles.
1. Abraham I, Bartal Y, Neiman O (2008) Nearly tight low stretch spanning trees. In: FOCS ’08: Proceedings of the 2008 49th annual IEEE symposium on foundations of computer science, Philadelphia. IEEE Computer Society, Washington, DC, pp 781–790
2. Abraham I, Neiman O (2012) Using petal-decompositions to build a low stretch spanning tree. In: Proceedings of the forty-fourth annual ACM symposium on theory of computing, STOC ’12, New York. ACM, pp 395–406
3. Alon N, Karp RM, Peleg D, West D (1995) A graph-theoretic game and its application to the k-server problem. SIAM J Comput 24(1):78–100
4. Bartal Y (1996) Probabilistic approximation of metric spaces and its algorithmic applications. In: Proceedings of the 37th annual symposium on foundations of computer science, Burlington. IEEE Computer Society, Washington, DC, pp 184–
5. Bartal Y (2004) Graph decomposition lemmas and their role in metric embedding methods. In: Albers S, Radzik T (eds) Proceedings of the 12th annual European symposium on algorithms – ESA 2004, Bergen, 14–17 Sept 2004. Volume 3221 of Lecture notes in computer science. Springer, pp 89–97