Ring routing and wavelength translation
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
SIAM Review
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
An Efficient Algorithm for the Ring Loading Problem with Integer Demand Splitting
SIAM Journal on Discrete Mathematics
Call control with k rejections
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Linear time algorithms for the ring loading problem with demand splitting
Journal of Algorithms
A quasi-PTAS for unsplittable flow on line graphs
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Algorithmica
A logarithmic approximation for unsplittable flow on line graphs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Admission control to minimize rejections and online set cover with repetitions
ACM Transactions on Algorithms (TALG)
Networks
An improved approximation algorithm for resource allocation
ACM Transactions on Algorithms (TALG)
A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths
FOCS '11 Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
| Hi-index | 0.89 |
The ring loading problem and its variants have been extensively studied in the last fifteen years, under the assumption that all requests have to be satisfied. However, in many practical cases, one may wish to reject some requests, which results in a penalty cost. We introduce the ring loading problem with penalty cost, which generalizes the well-known ring loading problem (Schrijver et al., 1999 [14]). We prove that this problem is NP-hard even if the demand can be split, and design a 1.58-approximation algorithm for the integer demand splittable case and a (1.58+@e)-approximation algorithm for the demand unsplittable case, for any given number @e0.