Author:
Kaklamanis C.,Krizanc D.,Rao S.
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference27 articles.
1. A. Agrawal, P. Klein, S. Rao, and R. Ravi. Approximation through multicommodity flow.Proceedings of the 30th Annual Symposium on Foundations of Computer Science, pages 726–737, October 1989.
2. W. Aiello and T. Leighton. Coding theory, hypercube embeddings, and fault tolerance.Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, pages 125–136, July 1991.
3. N. Alon, P. Seymour, and R. Thomas. A separator theorem for graphs with an excluded minor and its applications.Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, pages 293–299, May 1990.
4. B. Awerbuch, B. Berger, L. Cowen, and D. Peleg. Fast constructions of sparse neighborhood covers. Unpublished manuscript.
5. B. Awerbuch and D. Peleg. Sparse partitions. Proceedings of the 31st Symposium on Foundations of Computer Science, pages 503–513, 1990.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Changing Challenges for Collaborative Algorithmics;Handbook of Nature-Inspired and Innovative Computing