1. Adjiashvili, D.: Beating approximation factor two for weighted tree augmentation with bounded costs. ACM Trans. Algorithms (TALG) 15(2), 1–26 (2018)
2. Alexander, A., Boyd, S., Elliott-Magwood, P.: On the integrality gap of the 2-edge connected subgraph problem. Technical report. Citeseer (2006)
3. Cecchetto, F., Traub, V., Zenklusen, R.: Bridging the gap between tree and connectivity augmentation: unified and stronger approaches. In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, pp. 370–383 (2021)
4. Cheriyan, J., Dippel, J., Grandoni, F., Khan, A., Narayan, V.V.: The matching augmentation problem: a 7/4-approximation algorithm. Math. Program. 182(1), 315–354 (2020)
5. Cheriyan, J., Cummings, R., Dippel, J., Zhu, J.: An improved approximation algorithm for the matching augmentation problem. arXiv preprint arXiv:2007.11559 (2020)