Abstract: Based on prize-collecting call control problem, the recoverable robust prize-collecting call control problem is further proposed and a 1.58-approximation algorithm for this problem is designed. In particular, when there are two edges on the weighted line and two scenarios, a dynamic programming algorithm is presented, and a fully polynomial time approximation scheme based on dynamic programming algorithm finally designed to solve the problem, .