1. Lecture Notes in Computer Science;H.-J. Böchenhauer,2002
2. Czumaj, A., Lingas, A.: On approximability of the minimum-cost k-connected spanning subgraph problem. In: Proc. of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1999), pp. 281–290. ACM Press, New York (1999)
3. Diestel, R.: Graph theory. electronic edn. Springer, Heidelberg (2000)
4. Frederickson, G.N., Jájá, J.: On the relationship between the biconnectivity augmentation and traveling salesman problems. Theoretical Computer Science 19, 189–201 (1982)
5. Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-Completeness. W.H. Freeman and Company, New York (1979)