On the k-coloring of intervals
Discrete Applied Mathematics
Efficient on-line call control algorithms
Journal of Algorithms
Online computation and competitive analysis
Online computation and competitive analysis
An O(n2 algorithm for circular-arc graph recognition
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Ring routing and wavelength translation
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Admission Control to Minimize Rejections
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Developments from a June 1996 seminar on Online algorithms: the state of the art
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Competitive routing of virtual circuits in ATM networks
IEEE Journal on Selected Areas in Communications
Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs
Journal of Discrete Algorithms
1.5-Approximation algorithm for weighted maximum routing and wavelength assignment on rings
Information Processing Letters
Wavelength assignment for satisfying maximal number of requests in all-optical networks
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
Maximizing the number of connections in multifiber WDM chain, ring and star networks
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms
Discrete Optimization
Call control and routing in SONET rings
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
| Hi-index | 0.00 |
The call control problem is an important optimization problem encountered in the design and operation of communication networks. The goal of the call control problem in rings is to compute, for a given ring network with edge capacities and a set of paths in the ring, a maximum cardinality subset of the paths such that no edge capacity is violated. We give a polynomial-time algorithm to solve the problem optimally. The algorithm is based on a decision procedure that checks whether a solution with at least k paths exists, which is in turn implemented by an iterative greedy approach operating in rounds.We show that the algorithm can be implemented efficiently and, as a by-product, obtain a linear-time algorithm to solve the call control problem in chains optimally.