Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference22 articles.
1. D. Adjiashvili, Beating approximation factor two for weighted tree augmentation with bounded costs, in: SODA, 2017, pp. 2384–2399.
2. J. Cheriyan, Z. Gao, Approximating (unweighted) tree augmentation via lift-and-project, part II, CoRR, abs/1507.01309, 2015.
3. J. Cheriyan, T. Jordán, R. Ravi, On 2-coverings and 2-packing of laminar families, in: ESA, 1999, pp. 510–520.
4. On the integrality ratio for tree augmentation;Cheriyan;Oper. Res. Lett.,2008
5. A (1+ln2)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius;Cohen;Theoret. Comput. Sci.,2013
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献