Author:
Sengupta Sinchan,Peri Sathya,Anjana Parwat Singh
Publisher
Springer International Publishing
Reference28 articles.
1. Abraham, I., Neiman, O.: Using petal-decompositions to build a low stretch spanning tree. In: Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing, pp. 395–406 (2012)
2. Alon, N., Karp, R.M., Peleg, D., West, D.: A graph-theoretic game and its application to the k-server problem. SIAM J. Comput. 24(1), 78–100 (1995)
3. Arora, A., Gouda, M., Herman, T.: Composite routing protocols. In: Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing 1990, pp. 70–78. IEEE (1990)
4. Awerbuch, B.: Complexity of network synchronization. J. ACM (JACM) 32(4), 804–823 (1985)
5. Bartal, Y.: Probabilistic approximation of metric spaces and its algorithmic applications. In: Proceedings of 37th Conference on Foundations of Computer Science, pp. 184–193. IEEE (1996)