Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference24 articles.
1. Auletta, V., Dinitz, Y., Nutov, Z., Parente, D.: A 2-approximation algorithm for finding an optimum 3-vertex-connected spanning subgraph. J. Algorithms 32(1), 21–30 (1999)
2. Byrka, J., Grandoni, F., Rothvoß, T., Sanità, L.: Steiner tree approximation via iterative randomized rounding. J. ACM 60(1), 6 (2013)
3. Chakraborty, T., Chuzhoy, J., Khanna, S.: Network design for vertex connectivity. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, STOC’08, pp. 167–176 (2008)
4. Cheriyan, J., Laekhanukit, B.: Approximation algorithms for minimum-cost k-(S, T) connected digraphs. SIAM J. Discrete Math. 27(3), 1450–1481 (2013)
5. Cheriyan, J., Laekhanukit, B., Naves, G., Vetta, A.: Approximating rooted Steiner networks. To appear in ACM Trans. Algorithms
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献