We present a 1.91457-approximation algorithm for the prize-collecting travelling salesman problem. This is obtained by combining a randomized variant of a rounding algorithm of Bienstock et al. [2] and a primal-dual algorithm of Goemans and Williamson [5].
['Michel X. Goemans']
Combining Approximation Algorithms for the Prize-Collecting TSP