In this paper, we prove that the PCCC problem on weighted lines is NP-hard even for special cases, and design a 1.582-approximation algorithm using a randomized.

In this paper, we prove that the PCCC problem on weighted lines is NP-hard even for special cases, and design a 1.582-approximation algorithm using a randomized ...

Oct 24, 2022 · In this paper, we prove that the PCCC problem on weighted lines is N P -hard even for special cases, and design a 1.582-approximation algorithm ...

It is proved that the PCCC problem on weighted lines is NP -hard even for special cases, and a 1.582-approximation algorithm is designed using a randomized ...

The Prize-collecting Call Control Problem on Weighted Lines and Rings. Weidong Li, RAIRO Oper. Res., 2013. Reactive GRASP for the Prize-collecting Covering ...

This paper designs a 2-approximation algorithm using linear programming rounding technique and some optimal algorithms and approximation algorithms for some ...

Weidong Li , Jianping Li, Li Guan, Yaomin Shi: The Prize-collecting Call Control Problem on Weighted Lines and Rings. RAIRO Oper. Res. 50(1): 39-46 (2016) ...

Oct 22, 2024 · The call control problem is an important optimization problem encountered in the design and operation of communication networks.

Abstract. Based on prize-collecting call control problem, the recoverable robust prize-collecting call control problem is further proposed and a 1.58- ...

In this paper, we prove that the PCCC problem on weighted lines is NP-hard even for special cases, and design a 1.582-approximation algorithm using a randomized ...