Subject
General Computer Science,Theoretical Computer Science
Reference43 articles.
1. Nearly tight low stretch spanning trees;Abraham,2008
2. Beating approximation factor two for weighted tree augmentation with bounded costs;Adjiashvili;ACM Trans. Algorithms,2019
3. Node connectivity augmentation via iterative randomized rounding;Angelidakis;Math. Program.,2023
4. Parameterized algorithms to preserve connectivity;Basavaraju,2014
5. Improved approximation algorithms for (budgeted) node-weighted Steiner problems;Bateni;SIAM J. Comput.,2018