Call control in rings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2380 LNCS, Issue , 2002, Pages 788-799

  Adamy, Udo ^a   Ambuehl, Christoph ^a   Anand, R Sai ^a   Erlebach, Thomas ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; CLUSTERING ALGORITHMS; POLYNOMIAL APPROXIMATION;

CARDINALITIES; DECISION PROCEDURE; DESIGN AND OPERATIONS; GREEDY APPROACHES; LINEAR-TIME ALGORITHMS; OPTIMIZATION PROBLEMS; POLYNOMIAL-TIME ALGORITHMS; RING NETWORKS;

ITERATIVE METHODS;

EID: 84869161167     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45465-9_67     Document Type: Conference Paper

References (13)

1. R. Adler andY. Azar. Beating the logarithmic lower bound: Randomized preemptive disjoint paths and call control algorithms. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms SODA'99, pages 1-10, 1999.
2. A. Blum,A. Kalai, and J. Kleinberg. Admission control to minimize rejections. In Proceedings of the 7th International Workshop on Algorithms and Data Structures (WADS 2001), LNCS 2125, pages 155-164, 2001.
3. A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
4. M. C. Carlisle and E. L. Lloyd. On the k-coloring of intervals. Discrete Applied Mathematics, 59:225-235, 1995.
5. 2) algorithm for circular-arc graph recognition. In Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms SODA'93, pages 128-137, 1993.
6. H. Gabow and R. Tarjan. A linear-time algorithm for a special case of disjoint set union. Journal of Computer and System Sciences, 30(2):209-221, 1985.
7. J. A. Garay, I. S. Gopal, S. Kutten, Y. Mansour, and M. Yung. Efficient on-line call control algorithms. Journal of Algorithms, 23:180-194, 1997.
8. M. R. Garey, D. S. Johnson, G. L. Miller, and C. H. Papadimitriou. The complexity of coloring circular arcs and chords. SIAM J. Algebraic Discrete Methods, 1(2):216-227, 1980.
9. M. C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, NewYork, 1980.
10. I. A. Karapetian. On the coloring of circular arc graphs. Journal of the Armenian Academy of Sciences, 70(5):306-311, 1980. (in Russian)
11. S. Leonardi. On-line network routing. In A. Fiat and G. J. Woeginger, editors, Online Algorithms: The State of the Art, LNCS 1442. Springer-Verlag, Berlin, 1998.
12. S. Plotkin. Competitive routing of virtual circuits inATMnetworks. IEEE Journal of Selected Areas in Communications, 13(6):1128-1136, August 1995.
13. G. Wilfong and P. Winkler. Ring routing and wavelength translation. In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms SODA'98, pages 333-341, 1998.