Csaba, Bela Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Krysta, Piotr Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Csaba, B., Krysta, P., & Karpinski, M. (2002). Approximability of Dense and Sparse Instances of Minimum 2-Connectivity, TSP and Path Problems. In Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-02) (pp. 74-83). New York, USA: ACM.