Publisher
Springer International Publishing
Reference25 articles.
1. Bartal, Y.: Probabilistic approximations of metric spaces and its algorithmic applications. In: FOCS, pp. 184–193 (1996)
2. Chalermsook, P., Das, S., Laekhanukit, B., Vaz, D.: Beyond metric embedding: approximating group Steiner trees on bounded treewidth graphs. In: SODA, pp. 737–751 (2017)
3. Charikar, M., et al.: Approximation algorithms for directed Steiner problems. J. Algorithms 33(1), 73–91 (1999)
4. Chekuri, C., Even, G., Kortsarz, G.: A greedy approximation algorithm for the group Steiner problem. Discrete Appl. Math. 154(1), 15–34 (2006)
5. Dehghani, S., Ehsani, S., Hajiaghayi, M.T., Liaghat, L.: Online degree-bounded Steiner network design. In: SODA, pp. 164–175 (2016)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献