Call control with k rejections

Given a set of connection requests (calls) in a communication network, the call control problem is to accept a subset of the requests and route them along paths in the network such that no edge capacity is violated, with the goal of rejecting as few requests as possible. We investigate the complexity of parameterized versions of this problem, where the number of rejected requests is taken as the parameter. For the variant with pre-determined paths, the problem is fixed-parameter tractable in arbitrary graphs if the link capacities are bounded by a constant, but W[2]-hard if the link capacities are arbitrary. If the paths are not pre-determined, no FPT algorithm can exist even in series-parallel graphs unless P = NP. Our main results are newFPT algorithms for call control in tree networks with arbitrary edge capacities and in trees of rings with unit edge capacities in the case that the paths are not pre-determined.

[1]  Weijia Jia,et al.  Vertex Cover: Further Observations and Further Improvements , 2001, J. Algorithms.

[2]  Rolf Niedermeier,et al.  A general method to speed up fixed-parameter-tractable algorithms , 2000, Inf. Process. Lett..

[3]  Jens Vygen,et al.  The edge-disjoint paths problem is NP-complete for series-parallel graphs , 2001, Discret. Appl. Math..

[4]  Yossi Azar,et al.  Strongly Polynomial Algorithms for the Unsplittable Flow Problem , 2001, IPCO.

[5]  Venkatesan Guruswami,et al.  Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems , 2003, J. Comput. Syst. Sci..

[6]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[7]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[8]  Jon M. Kleinberg,et al.  Approximation algorithms for disjoint paths problems , 1996 .

[9]  Errol L. Lloyd,et al.  on the K-coloring of Intervals , 1991, Discrete Applied Mathematics.

[10]  Rolf Niedermeier,et al.  An efficient fixed-parameter algorithm for 3-Hitting Set , 2003, J. Discrete Algorithms.

[11]  Thomas Erlebach.  Approximation algorithms and complexity results for path problems in trees of rings , 2001 .

[12]  Adam Tauman Kalai,et al.  Admission Control to Minimize Rejections , 2003, Internet Math..

[13]  Hans L. Bodlaender,et al.  A Partial k-Arboretum of Graphs with Bounded Treewidth , 1998, Theor. Comput. Sci..

[14]  Éva Tardos,et al.  Disjoint paths in densely embedded graphs , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[15]  Klaus Jansen,et al.  The Maximum Edge-Disjoint Paths Problem in Bidirected Trees , 2001, SIAM J. Discret. Math..