Csaba, Béla; Karpinski, Marek; Krysta, Piotr Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems. (English) Zbl 1093.68677 Proceedings of the thirteenth annual ACM-SIAM symposium on discrete algorithms, San Francisco, CA, USA, January 6–8, 2002. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 0-89871-513-X/pbk). 74-83 (2002). Cited in 9 Documents MSC: 68W25 Approximation algorithms 90C35 Programming involving graphs or networks PDF BibTeX XML Cite \textit{B. Csaba} et al., in: Proceedings of the thirteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2002, San Francisco, CA, USA, January 6--8, 2002. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 74--83 (2002; Zbl 1093.68677)