Maximizing the number of connections in optical tree networks

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

Volumn 1533 LNCS, Issue , 1998, Pages 179-189

  Erlebach, Thomas ^a   Jansen, Klaus ^b  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^b DALLE MOLLE INSTITUTE FOR ARTIFICIAL INTELLIGENCE IDSIA   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; DECISION TREES; FIBER OPTIC NETWORKS; FORESTRY; POLYNOMIAL APPROXIMATION;

DIRECTED TREES; FULL WAVELENGTH CONVERSION; MULTIPLE CONNECTIONS; PATH COLORINGS; PERFORMANCE RATIO; POLYNOMIAL TIME APPROXIMATION ALGORITHMS; POLYNOMIAL-TIME; WAVELENGTH CONVERTER;

TREES (MATHEMATICS);

EID: 84867437935     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49381-6_20     Document Type: Conference Paper

References (12)

1. B. Awerbuch, Y. Azar, A. Fiat, S. Leonardi, and A. Rosén. On-line competitive algorithms for call admission in optical networks. In Proceedings of the 4th Annual European Symposium on Algorithms ESA '96, LNCS 1136, pages 431-444. Springer-Verlag, 1996.
2. 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.
3. N. Garg, V. V. Vazirani, and M. Yannakakis. Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover. In Proceedings of the 20th International Col loquium on Automata, Languages and Programming, ICALP '93, LNCS 700, pages 64-75. Springer-Verlag, 1993.
4. M. Grötschel, L. Lovász, and A. Schrijver. Geometric algorithms and combinatorial optimization. Springer-Verlag, Berlin, 1988.
5. C. Kaklamanis and P. Persiano. Efficient wavelength routing on directed fiber trees. In Proceedings of the 4th Annual European Symposium on Algorithms ESA '96, LNCS 1136, pages 460-470. Springer-Verlag, 1996.
6. C. Kaklamanis, P. Persiano, T. Erlebach, and K. Jansen. Constrained bipartite edge coloring with applications to wavelength routing. In Proceedings of the 24th International Colloquium on Automata, Languages and Programming ICALP '97, LNCS 1256, pages 493-504. Springer-Verlag, 1997.
7. V. Kumar and E. J. Schwabe. Improved access to optical bandwidth in trees. In Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms SODA '97, pages 437-444, 1997.
8. M. Mihail, C. Kaklamanis, and S. Rao. Efficient access to optical bandwidth. In Proceedings of the 36th Annual Symposium on Foundations of Computer Science, pages 548-557, 1995.
9. C. Nomikos and S. Zachos. Coloring a maximum number of paths in a graph. Presented at the Workshop on Algorithmic Aspects of Communication (July 11-12, 1997, Bologna, Italy).
10. P. Raghavan and E. Upfal. Efficient routing in all-optical networks. In Proceedings of the 26th Annual ACM Symposium on Theory of Computing STOC '94, pages 134-143, New York, 1994. ACM SIGACT, ACM Press.
11. P.-J. Wan and L. Liu. Maximal throughput in optical networks, 1998. Presented at the DIMACS Workshop on Optical Networks (March 16-19, 1998).
12. M. Yannakakis and F. Gavril. The maximum k-colorable subgraph problem for chordal graphs. Inf. Process. Lett., 24(2):133-137, January 1987.