Approximation algorithms and a pseudometric version of the traveling salesman problem

An Article contains classical approach to approximation algorithms, there are given examples illustrating the basic definition of these algorithms. There are contained polynomial-time approximation scheme and fully polynomial-time approximation scheme. There is cited an example psevdometric traveling salesperson problem. Efficient algorithms giving optimal solution this problem haven't yet developed.