ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Journal of Computer and System Sciences
Volume 67, Issue 4, December 2003, Pages 707-722
Parameterized Computation and Complexity 2003
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (207 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/S0022-0000(03)00076-X    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2003 Elsevier Science (USA). All rights reserved.

Call control with k rejections*1

R. Sai AnandE-mail The Corresponding Author, 1, Thomas ErlebachCorresponding Author Contact Information, E-mail The Corresponding Author, Alexander HallE-mail The Corresponding Author, 1 and Stamatis StefanakosE-mail The Corresponding Author

Computer Engineering and Networks Laboratory (TIK), ETH Zürich, Gloriastrasse 35, CH-8092, Zürich, Switzerland

Received 1 October 2001; 
revised 4 May 2002. 
Available online 19 November 2003.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

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 Image . Our main results are new FPT 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.


Journal of Computer and System Sciences
Volume 67, Issue 4, December 2003, Pages 707-722
Parameterized Computation and Complexity 2003
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.