The prize-collecting call control problem

The prize-collecting call control problem is to minimize the sum of the maximum load on the edges and the total penalty costs of the rejected calls. In this paper, we design a 2-approximation algorithm using linear programming rounding technique, and a 1.58-approximation algorithm using randomized rounding technique for this problem. We also present some optimal algorithms and approximation algorithms for some special graphs including rings, lines and stars.