Off-line and on-line call-scheduling in stars and trees-Reference-Cited by-同舟云学术

Off-line and on-line call-scheduling in stars and trees

Published:1997 Issue: Volume: Page:199-213
ISSN:0302-9743
Container-title:Graph-Theoretic Concepts in Computer Science
language:
Short-container-title:

Author:

Erlebach Thomas,Jansen Klaus

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0024499

Reference16 articles.

1. Y. Aumann and Y. Rabani. Improved bounds for all optical routing. In Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms SODA '95, pages 567–576, 1995.

2. B. Awerbuch, Y. Bartal, A. Fiat, and A. Rosén. Competitive non-preemptive call control. In Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms SODA '94, pages 312–320, 1994.

3. Y. Bartal and S. Leonardi. On-line routing in all-optical networks. In Proceedings of the 24th International Colloquium on Automata, Languages and Programming ICALP '97, LNCS 1256, pages 516–526. Springer-Verlag, 1997.

4. E. Coffman, Jr., M. Garey, D. Johnson, and A. Lapaugh. Scheduling file transfers. SIAM J. Comput., 14(3):744–780, August 1985.

5. T. Erlebach and K. Jansen. Scheduling of virtual connections in fast networks. In Proceedings of the 4th Parallel Systems and Algorithms Workshop PASA '96, pages 13–32. World Scientific Publishing, 1997.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Online Coloring of Intervals with Bandwidth;Approximation and Online Algorithms;2004

2. Routing and Admission Control in Networks with Advance Reservations;Approximation Algorithms for Combinatorial Optimization;2002

3. The complexity of path coloring and call scheduling;Theoretical Computer Science;2001-03