APA (7th ed.) Citation

Cohen, N., & Nutov, Z. (2013). A (1+ln2)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius. Theoretical computer science, 489-490, 67-74. https://doi.org/10.1016/j.tcs.2013.04.004

Chicago Style (17th ed.) Citation

Cohen, Nachshon, and Zeev Nutov. "A (1+ln2)-approximation Algorithm for Minimum-cost 2-edge-connectivity Augmentation of Trees with Constant Radius." Theoretical Computer Science 489-490 (2013): 67-74. https://doi.org/10.1016/j.tcs.2013.04.004.

MLA (9th ed.) Citation

Cohen, Nachshon, and Zeev Nutov. "A (1+ln2)-approximation Algorithm for Minimum-cost 2-edge-connectivity Augmentation of Trees with Constant Radius." Theoretical Computer Science, vol. 489-490, 2013, pp. 67-74, https://doi.org/10.1016/j.tcs.2013.04.004.