| Issue |
RAIRO-Oper. Res.
Volume 50, Number 1, January-March 2016
|
|
|---|---|---|
| Page(s) | 39 - 46 | |
| DOI | https://doi.org/10.1051/ro/2015010 | |
| Published online | 26 August 2015 | |
The Prize-collecting Call Control Problem on Weighted Lines and Rings
1 Yunnan University, Kunming 650091, P.R. China.
weidong@ynu.edu.cn,jianping@ynu.edu.cn,guanli@ynu.edu.cn
2 Chongqing Radio & TV University, Chongqing, P.R. China.
109481082@qq.com
Received:
5
September
2013
Accepted:
26
March
2015
Given a set of request calls with different demands and penalty costs, the prize-collecting call control (PCCC) problem is to minimize the sum of the maximum load on the edges and the total penalty cost of the rejected calls. 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 rounding technique. In addition, we consider some special cases of the PCCC problem on weighted lines and rings.
Mathematics Subject Classification: 90C27
Key words: Prize-collecting / call control / approximation algorithms
© EDP Sciences, ROADEF, SMAI 2015
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.