Abstract
Motivated by the problem of WDM routing in all-optical networks, we study the following NP-hard problem. We are given a directed binary tree T and a set R of directed paths on T. We wish to assign colors to paths in R, in such a way that no two paths that share a directed arc of T are assigned the same color and that the total number of colors used is minimized. Our results are expressed in terms of the depth of the tree and the maximum load l of R, i.e., the maximum number of paths that go through a directed arc of T. So far, only deterministic greedy algorithms have been presented for the problem. The best known algorithm colors any set R of maximum load l using at most 5l/3 colors. Alternatively, we say that this algorithm has performance ratio 5/3. It is also known that no deterministic greedy algorithm can achieve a performance ratio better than 5/3. In this paper we define the class of greedy algorithms that use randomization. We study their limitations and prove that, with high probability, randomized greedy algorithms cannot achieve a performance ratio better than 3/2 when applied to binary trees of depth Ω(l), and 1.293 - o(1) when applied to binary trees of constant depth. Exploiting inherent properties of randomized greedy algorithms, we obtain the first randomized algorithm for the problem that uses at most 7l/5 + o(l) colors for coloring any set of paths of maximum load l on binary trees of depth o(l 1/3), with high probability. We also present an existential upper bound of 7l/5 + o(l) that holds on any binary tree. In the analysis of our bounds we use tail inequalities for random variables following hypergeometrical probability distributions which may be of their own interest.
This work is partially supported by EU IST Project ALCOM-FT, EU RTN Project ARACNE, Progetto Cofinanziato of MURST-Italy and by a research grant from the Università di Salerno.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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
K. Azuma. Weighted Sums of Certain Dependent Random Variables. Tohoku Mathematical Journal, 19:357–367, 1967.
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.
H. Cherno.. A Measure of Asymptotic Efficiency for Tests of a Hypothesis based on the Sum of Observations. Annals of Mathematical Statistics, 23:493–509, 1952.
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.
T. Erlebach, K. Jansen. Call Scheduling in Trees, Rings and Meshes. In Proc. of the 30th Hawaii International Conference on System Sciences, 1997.
W. Feller. An Introduction to Probability Theory and Its Applications: Volume I, John Wiley and Sons, 1968.
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.
W. Hoeffding. Probability Inequalities for sums of Bounded Random Variables. Journal of the American Statistics Association, 58:13–30, 1963.
K. Jansen. Approximation Results for Wavelength Routing in Directed Trees. 2nd Workshop on Optics and Computer Science (WOCS’ 97), 1997.
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.
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.
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.
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.
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.
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.
R. Motwani, P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
Y. Rabani. Path Coloring on the Mesh. In Proc. of the 37th Annual Symposium on Foundations of Computer Science (FOCS’ 96), 1996.
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.
R. Ramaswami, K. Sivarajan. Optical Networks. Morgan Kauffman Publishers, 1998.
J. P. Schmidt, A. Siegel, A. Srinivasan. Cherno.-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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Auletta, V., Caragiannis, I., Kaklamanis, C., Persiano, P. (2000). Randomized Path Coloring on Binary Trees. In: Jansen, K., Khuller, S. (eds) Approximation Algorithms for Combinatorial Optimization. APPROX 2000. Lecture Notes in Computer Science, vol 1913. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44436-X_8
Download citation
DOI: https://doi.org/10.1007/3-540-44436-X_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67996-7
Online ISBN: 978-3-540-44436-7
eBook Packages: Springer Book Archive