Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference31 articles.
1. Chakraborty, T., Chuzhoy, J., Khanna, S.: Network design for vertex connectivity. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC), pp. 167–176 (2008)
2. Charikar, M., Chekuri, C., Cheung, T., Dai, Z., Goel, A., Guha, S., Li, M.: Approximation algorithms for directed Steiner problems. J. Algorithms 33, 73–91 (1999)
3. Cheriyan, J., Vetta, A.: Approximation algorithms for network design with metric costs. SIAM J. Discrete Math. 21(3), 612–636 (2007)
4. Chuzhoy, J., Khanna, S.: An O(k 3log n)-approximation algorithms for vertex-connectivity network design. In: Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 437–441 (2009)
5. Dodis, Y., Khanna, S.: Design networks with bounded pairwise distance. In: Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC), pp. 750–759 (2003)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献