Zeev Nutov. An almost ::::O::::(log ::::k::::)-approximation for ::::k::::-connected subgraphs. In Claire Mathieu, editor, Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009. pages 912-921, SIAM, 2009. [doi]
Abstract is missing.