Abstract
Motivated by the wavelength assignment problem in WDM optical networks, we study path coloring problems in graphs. Given a set of paths P on a graph G, the path coloring problem is to color the paths of P so that no two paths traversing the same edge of G are assigned the same color and the total number of colors used is minimized. The problem has been proved to be NP-hard even for trees and rings.
Using optimal solutions to fractional path coloring, a natural relaxation of path coloring, on which we apply a randomized rounding technique combined with existing coloring algorithms, we obtain new upper bounds on the minimum number of colors sufficient to color any set of paths on any graph. The upper bounds are either existential or constructive.
The existential upper bounds significantly improve existing ones provided that the cost of the optimal fractional path coloring is sufficiently large and the dilation of the set of paths is small. Our algorithmic results include improved approximation algorithms for path coloring in rings and in bidirected trees. Our results extend to variations of the original path coloring problem arizing in multifiber WDM optical networks.
This work was partially funded by the European Union under IST FET Project ALCOM–FT, IST FET Project CRESCCO and RTN Project ARACNE.
This is a preview of subscription content, log in via an institution to check access.
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
Auletta, V., Caragiannis, I., Kaklamanis, C., Persiano, P.: Randomized Path Coloring on Binary Trees. Theoretical Computer Science 289(1), 355–399 (2002)
Beauquier, B., Bermond, J.-C., Gargano, L., Hell, P., Perennes, S., Vaccaro, U.: Graph Problems arising from Wavelength-Routing in All-Optical Networks. In: Proc. of the 2nd Workshop on Optics and Computer Science, WOCS 1997 (1997)
Caragiannis, I., Ferreira, A., Kaklamanis, C., Perennes, S., Rivano, H.: Fractional Path Coloring with Applications to WDM Networks. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 732–743. Springer, Heidelberg (2001)
Erlebach, T., Jansen, K.: The Complexity of Path Coloring and Call Scheduling. Theoretical Computer Science 255(1-2), 33–50 (2000)
Erlebach, T., Jansen, K., Kaklamanis, C., Mihail, M., Persiano, P.: Optimal Wavelength Routing in Directed Fiber Trees. Theoretical Computer Science 221(1-2), 119–137 (1999)
Ferreira, A., Perennes, S., Richa, A.W., Rivano, H., Stier Moses, N.: Models, Complexity and Algorithms for the Design of Multifiber WDM Networks. Telecommunication Systems 24(2), 123–138 (2003)
Garey, M.R., Johnson, D.S., Miller, G.L., Papadimitriou, C.H.: The Complexity of Coloring Circular Arcs and Chords. SIAM Journal on Alg. Disc. Math. 1(2), 216–227 (1980)
Grötschel, M., Lovász, L., Schrijver, A.: The Ellipsoid Method and its Consequences in Combinatorial Optimization. Combinatorica 1, 169–197 (1981)
Jansen, K.: Approximate Strong Separation with Application in Fractional Graph Coloring and Preemptive Scheduling. Theoretical Computer Science 302(1-3), 239–256 (2003)
Jansen, K., Porkolab, L.: On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes. In: Cook, W.J., Schulz, A.S. (eds.) IPCO 2002. LNCS, vol. 2337, pp. 329–349. Springer, Heidelberg (2002)
Kumar, V.: An Approximation Algorithm for Circular Arc Coloring. Algorithmica 30(3), 406–417 (2001)
Li, G., Simha, R.: On the Wavelength Assignment Problem on Multifiber WDM Star and Ring Networks. IEEE/ACM Transactions on Networking 9(1), 60–68 (2001)
Li, G., Simha, R.: On Bounds for the Wavelength Assignment Problem on Optical Ring Networks. Journal of High-Speed Networks 8(4), 303–309 (1999)
Lovász, L.: On the Ratio of Optimal Integral and Fractional Covers. Discrete Mathematics 13, 383–390 (1975)
Margara, L., Simon, J.: Wavelength Assignment Problem on All–Optical Networks with k Fibers per Link. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 768–779. Springer, Heidelberg (2000)
Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)
Raghavan, P., Thompson, C.D.: Randomized Rounding: A Technique for Provably Good Algorithms and Algorithmic Proofs. Combinatorica 7, 365–374 (1987)
Ramaswami, R., Sivarajan, K.: Optical Networks: A Practical Perspective. Morgan Kauffman Publishers, San Francisco (1998)
Tucker, A.: Coloring a Family of Circular Arcs. SIAM Journal of Applied Mathematics 29(3), 493–502 (1975)
Valencia–Pabon, M.E.: Revisiting Tucker’s Algorithm to Color Circular–Arc Graphs. Electronic Notes on Discrete Mathematics (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Caragiannis, I., Kaklamanis, C. (2004). Approximate Path Coloring with Applications to Wavelength Assignment in WDM Optical Networks. In: Diekert, V., Habib, M. (eds) STACS 2004. STACS 2004. Lecture Notes in Computer Science, vol 2996. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24749-4_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-24749-4_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21236-2
Online ISBN: 978-3-540-24749-4
eBook Packages: Springer Book Archive