1. Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems;Arora;J. ACM,1998
2. G.T. Chen, G.L. Xue, K-pair delay constrained minimum cost routing in undirected networks, SODA2001–ACM-SIAM Symp. on Discrete Algorithms, pp. 230–231.
3. Grade of service Steiner trees on a series–parallel network;Colbourn,2000
4. D.Z. Du, F.K. Hwang, An approach for proving lower bounds: solution of Gilbert–Pollak conjecture on Steiner ratio, IEEE FOCS’90, pp. 76–85.
5. Networks immune to isolated failures;Farley;Networks,1981