1. Althöfer, I., Das, G., Dobkin, D., Joseph, D., Soares, J.: On sparse spanners of weighted graphs. Discrete Comput. Geom. 9, 81–100 (1993)
2. Arora, S., Grigni, M., Karger, D., Klein, P., Woloszyn, A.: A polynomial time approximation scheme for weighted planar graph TSP. In: SODA 1998, pp. 33–41 (1998)
3. Berger, A., Grigni, M., Zhao, H.: A well-connected separator for planar graphs (2004) (Manuscript)
4. Cheriyan, J., Vempala, S., Vetta, A.: An approximation algorithm for the minimum-size k-vertex connected subgraph. SIAM J. Comput. 32(4), 1050–1055 (2003)
5. Czumaj, A., Grigni, M., Sissokho, P., Zhao, H.: Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs. In: SODA 2004, pp. 489–498 (2004)