Randomized path coloring on binary trees

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

Volumn 1913, Issue , 2000, Pages 60-71

  Auletta, Vincenzo ^a   Caragiannis, Ioannis ^b   Kaklamanis, Christos ^b   Persiano, Pino ^a  

^a UNIVERSITY OF SALERNO   (Italy)

^b UNIVERSITY OF PATRAS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COLOR; COMBINATORIAL OPTIMIZATION; PROBABILITY DISTRIBUTIONS; TREES (MATHEMATICS);

BEST-KNOWN ALGORITHMS; DIRECTED PATHS; GREEDY ALGORITHMS; HARD PROBLEMS; HIGH PROBABILITY; PATH COLORINGS; PERFORMANCE RATIO; RANDOMIZED ALGORITHMS;

BINARY TREES;

EID: 84937441974     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44436-x_8     Document Type: Conference Paper

References (21)

1. V. Auletta, I. Caragiannis, C. Kaklamanis, P. Persiano. Randomized Path Coloring on Binary Trees. CTI Technical Report 2000–01–05, January 2000. http://students.ceid.upatras.gr/~caragian/ackp00.ps
2. K. Azuma. Weighted Sums of Certain Dependent Random Variables. Tohoku Mathematical Journal, 19:357–367, 1967.
3. I. Caragiannis, C. Kaklamanis, P. Persiano. Bounds on Optical Bandwidth Allocation on Directed Fiber Tree Topologies. 2nd Workshop on Optics and Computer Science (WOCS’97), 1997.
4. H. Chernoff. A Measure of Asymptotic Efficiency for Tests of a Hypothesis based on the Sum of Observations. Annals of Mathematical Statistics, 23:493–509, 1952.
5. T. Erlebach, K. Jansen. Scheduling of Virtual Connections in Fast Networks. In Proc. of the 4th Workshop on Parallel Systems and Algorithms, pp. 13–32, 1996.
6. T. Erlebach, K. Jansen. Call Scheduling in Trees, Rings and Meshes. In Proc. of the 30th Hawaii International Conference on System Sciences, 1997.
7. W. Feller. An Introduction to Probability Theory and Its Applications: Volume I, John Wiley and Sons, 1968.
8. L. Gargano, P. Hell, S. Perennes, Colouring All Directed Paths in a Symmetric Tree with Applications to WDM Routing. In Proc. of the 24th International Colloquium on Automata, Languages, and Programming (ICALP’97), LNCS 1256, Springer, pp. 505–515.
9. W. Hoeffding. Probability Inequalities for sums of Bounded Random Variables. Journal of the American Statistics Association, 58:13–30, 1963.
10. K. Jansen. Approximation Results for Wavelength Routing in Directed Trees. 2nd Workshop on Optics and Computer Science (WOCS’97), 1997.
11. C. Kaklamanis, P. Persiano. Efficient Wavelength Routing on Directed Fiber Trees. In Proc. of the 4th European Symposium on Algorithms (ESA’96), LNCS 1136, Springer Verlag, 1996, pp. 460–470.
12. C. Kaklamanis, P. Persiano, T. Erlebach, K. Jansen. Constrained Bipartite Edge Coloring with Applications to Wavelength Routing. In Proc. of the 24th International Colloquium on Automata, Languages, and Programming (ICALP’97), LNCS 1256, Springer Verlag, 1997, pp. 493–504.
13. A. Kamath, R. Motwani, K. Palem, and P. Spirakis. Tail bounds for occupancy and the satisfiability threshold conjecture. In Proc. of the 35th Annual IEEE Symposium on Foundations of Computer Science (FOCS’94), pp. 592–603, 1994.
14. V. Kumar. Approximating Circular Arc Colouring and Bandwidth Allocation in All–Optical Ring Networks. In Proc. of the 1st International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX’98), 1998.
15. V. Kumar, E. Schwabe. Improved Access to Optical Bandwidth in Trees. In Proc. of the 8th Annual ACM–SIAM Symposium on Discrete Algorithms (SODA’97), 1997, pp. 437–444.
16. M. Mihail, C. Kaklamanis, S. Rao. Efficient Access to Optical Bandwidth. In Proc. of the 36th Annual Symposium on Foundations of Computer Science (FOCS’95), 1995, pp. 548–557.
17. R. Motwani, P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
18. Y. Rabani. Path Coloring on the Mesh. In Proc. of the 37th Annual Symposium on Foundations of Computer Science (FOCS’96), 1996.
19. P. Raghavan, E. Upfal. Efficient Routing in All-Optical Networks. In Proc. of the 26th Annual Symposium on Theory of Computing (STOC’94), 1994, pp. 133–143.
20. R. Ramaswami, K. Sivarajan. Optical Networks. Morgan Kauffman Publishers, 1998.
21. J. P. Schmidt, A. Siegel, A. Srinivasan. Chernoff–Hoeffding Bounds for Applications with Limited Independence. In Proc. of the 3rd Annual ACM–SIAM Symposium on Discrete Algorithms (SODA’93), 1993, pp. 331–340.