Publisher
Springer International Publishing
Reference38 articles.
1. Abraham, I., Bartal, Y., Neiman, O.: Nearly tight low stretch spanning trees. In: FOCS, pp. 781–790 (2008)
2. Adjiashvili, D.: Beating approximation factor two for weighted tree augmentation with bounded costs. In: SODA, pp. 2384–2399 (2017)
3. Basavaraju, M., Fomin, F.V., Golovach, P.A., Misra, P., Ramanujan, M.S., Saurabh, S.: Parameterized algorithms to preserve connectivity. ICALP, Part I, 800–811 (2014)
4. Bateni, M.H., Hajiaghayi, M.T., Liaghat, V.: Improved approximation algorithms for (budgeted) node-weighted Steiner problems. SIAM J. Comput. 47(4), 1275–1293 (2018)
5. Belgi, A., Nutov, Z.: An $$\tilde{O}(\log ^2 n)$$-approximation algorithm for $$2$$-edge-connected dominating set. CoRR abs/1912.09662 (2019). arxiv.org/abs/1912.09662
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献