Author:
Charikar Moses,Chekuri Chandra,Cheung To-yat,Dai Zuo,Goel Ashish,Guha Sudipto,Li Ming
Subject
Computational Theory and Mathematics,Computational Mathematics,Control and Optimization
Reference27 articles.
1. A. Agrawal, P. Klein, and R. Ravi, When trees collide: An approximation algorithm for generalized Steiner tree problem on networks, in23rd ACM Symposium on Theory of Computing, 1991, pp. 134–144.
2. Improved approximation algorithms for the Steiner tree problem;Berman;J. Algorithms,1994
3. The Steiner problems with edge lengths 1 and 2;Bern;Inform. Process. Lett.,1989
4. A. Blum, R. Ravi, and S. Vempala, A constant factor approximation for the k-mst problem, inProceedings of the 28th Annual ACM Symposium on Theory of Computing, 1996, pp. 442–448.
5. M. Charikar, C. Chekuri, T. Cheung, Z. Dai, A. Goel, S. Guha, and M. Li, Approximation Algorithms for Directed Steiner Problems, inProceedings of Ninth ACM-SIAM Symposium on Discrete Algorithms, 1998, pp. 192–200.
Cited by
203 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On Rooted k-Connectivity Problems in Quasi-Bipartite Digraphs;Operations Research Forum;2024-01-17
2. The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems;ACM Transactions on Computation Theory;2023-12-12
3. Navigational guidance – A deep learning approach;European Journal of Operational Research;2023-11
4. Better Trees for Santa Claus;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
5. Distributed algorithms from arboreal ants for the shortest path problem;Proceedings of the National Academy of Sciences;2023-01-30