Call control with k rejections

Journal of Computer and System Sciences

Volumn 67, Issue 4, 2003, Pages 707-722

  Anand, R Sai ^a   Erlebach, Thomas ^a   Hall, Alexander ^a   Stefanakos, Stamatis ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONGESTION CONTROL (COMMUNICATION); GRAPH THEORY; RESOURCE ALLOCATION; TELECOMMUNICATION TRAFFIC;

CALL CONTROL; FIXED-PARAMETER TRACTABILITY ALGORITHM;

TELECOMMUNICATION NETWORKS;

EID: 0346991450     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0022-0000(03)00076-X     Document Type: Article

References (16)

1. Y. Azar, O. Regev, Strongly polynomial algorithms for the unsplittable flow problem, in: Proceedings of the Eighth Integer Programming and Combinatorial Optimization Conference (IPCO), Lecture Notes in Computer Science, Vol. 2081, Springer, Berlin, 2001, pp. 15-29.
2. A. Blum, A. Kalai, J. Kleinberg, Admission control to minimize rejections, in: Proceedings of the Seventh International Workshop on Algorithms and Data Structures (WADS 2001), Lecture Notes in Computer Science, Vol. 2125, Springer, Berlin, 2001, pp. 155-164.
3. H.L. Bodlaender, A partial k-arboretum of graphs with bounded treewidth, Theoret. Comput. Sci. 209 (1998) 1-45.
4. A. Borodin, R. El-Yaniv, Online Computation and Competitive Analysis, Cambridge University Press, Cambridge, 1998.
5. M.C. Carlisle, E.L. Lloyd, On the k-coloring of intervals, Disc. Appl. Math. 59 (1995) 225-235.
6. J. Chen, I.A. Kanj, W. Jia, Vertex cover: further observations and further improvements, in: Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science WG'99, Lecture Notes in Computer Science, Vol. 1665, Springer, Berlin, 1999, pp. 313-324.
7. R. Downey, M. Fellows, Parameterized Complexity, Springer, New York, 1999.
8. T. Erlebach, Approximation algorithms and complexity results for path problems in trees of rings, in: Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science (MFCS 2001), Lecture Notes in Computer Science, Vol. 2136, Springer, Berlin, 2001, pp. 351-362.
9. T. Erlebach, K. Jansen, The maximum edge-disjoint paths problem in bidirected trees, SIAM J. Disc. Math. 14 (3) (2001) 326-355.
10. N. Garg, V. V. Vazirani, M. Yannakakis, Primal-dual approximation algorithms for integral flow and multicut in trees, Algorithmica 18 (1) (1997) 3-20.
11. V. Guruswami, S. Khanna, R. Rajaraman, B. Shepherd, M. Yannakakis, Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems, in: Proceedings of the 31st Annual ACM Symposium on Theory of Computing STOC'99, 1999, pp. 19-28.
12. J. Kleinberg, Approximation algorithms for disjoint paths problems, Ph.D. Thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, 1996.
13. J. Kleinberg, É. Tardos, Disjoint paths in densely embedded graphs, in: Proceedings of the 36th Annual Symposium on Foundations of Computer Science FOCS'95, 1995, pp. 52-61.
14. R. Niedermeier, P. Rossmanith, A general method to speed up fixed-parameter-tractable algorithms, Inform. Process. Lett. 73 (2000) 125-129.
15. R. Niedermeier, P. Rossmanith, An efficient fixed parameter algorithm for 3-Hitting Set, J. Discrete Algorithms (2003), to appear.
16. T. Nishizeki, J. Vygen, X. Zhou, The edge-disjoint paths problem is NP-complete for series-parallel graphs, Discrete Appl. Math. 115 (2001) 177-186.