Abstract
We study a generalized coloring and routing problem for interval and circular graphs that is motivated by design of optical line systems. In this problem we are interested in finding a coloring and routing of “demands” of minimum total cost where the total cost is obtained by accumulating the cost incurred at certain “links” in the graph. The colors are partitioned in sets and the sets themselves are ordered so that colors in higher sets cost more. The cost of a “link” in a coloring is equal to the cost of the most expensive set such that a demand going through the link is colored with a color in this set. We study different versions of the problem and characterize their complexity by presenting tight upper and lower bounds. For the interval graph we show that the most general problem is hard to approximate to within \(\sqrt{s}\) and we complement this result with a \(O(\sqrt{s})\)-approximation algorithm for the problem. Here s is proportional to the number of color sets. For the circular graph problem we show that most versions of the problem are hard to approximate to any bounded ratio and we present a 2(1 + ε) approximation scheme for a special version of the problem.
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
Bar-Noy, A., Bellare, M., Halldorsson, M.M., Shachnai, H., Tamir, T.: On chromatic sums and distributed resource allocation. Information and Computation 140, 183–202 (1998)
Bar-Noy, A., Kortsarz, G.: The minimum color-sum of bipartite graphs. Journal of Algorithms 28, 339–365 (1998)
Cosares, S., Saniee, I.: An Optimization Problem Related to Balancing Loads on SONET Rings. Telecommunication Systems 3(2), 165–181 (1994)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman Publication, New York (1979)
Garey, M.R., Johnson, D.S., Miller, G.L., Papadimitriou, C.H.: The complexity of coloring circular arcs and chords. SIAM Journal on Algebraic and Discrete Methods 1(2), 216–227 (1980)
Halldorsson, M.M., Kortsarz, G., Shachnai, H.: Minimizing Average Completion of Dedicated Tasks and Partially Ordered Sets. In: Goemans, M.X., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) RANDOM 2001 and APPROX 2001. LNCS, vol. 2129, pp. 114–126. Springer, Heidelberg (2001)
Jansen, K.: Approximation Results for the Optimum Cost Chromatic Partition Problem. Journal of Algorithms 34(1), 54–89 (2000)
Khanna, S.: A Polynomial Time Approximation Scheme for the SONET Ring Loading Problem. Bell Labs Technical Journal 36–41 (Spring 1997)
Kroon, L.G., Sen, A., Deng, H., Roy, A.: The optimal cost chromatic partition problem for trees and interval graphs. In: D’Amore, F., Marchetti-Spaccamela, A., Franciosa, P.G. (eds.) WG 1996. LNCS, vol. 1197. Springer, Heidelberg (1996)
Kubicka, E.: The chromatic sum of a graph. Ph.D. thesis, Western Michigan University (1989)
Kubicka, E., Kubicki, G., Kountanis, D.: Approximation Algorithms for the Chromatic Sum. In: Sherwani, N.A., Kapenga, J.A., de Doncker, E. (eds.) Great Lakes CS Conference 1989. LNCS, vol. 507, pp. 15–21. Springer, Heidelberg (1991)
Kubicka, E., Schwenk, A.J.: An introduction to chromatic sums. In: Proceedings of the seventeenth Annual ACM Comp. Sci., Conf., pp. 39–45. ACM Press, New York (1989)
Kumar, V.: Approximating circular arc coloring and bandwidth allocation in alloptical ring networks. In: Jansen, K., Rolim, J.D.P. (eds.) APPROX 1998. LNCS, vol. 1444, pp. 147–158. Springer, Heidelberg (1998)
Myung, Y.S.: An Efficient Algorithm for the Ring Loading Problem with Integer Demand Splitting. SIAM Journal on Discrete Mathematics 14(3), 291–298 (2001)
Nicoloso, S., Song, X., Sarrafzadeh, M.: On the sum coloring problem on interval graphs. Algorithmica 23, 109–126 (1999)
Ozdaglar, A.E., Bertsekas, D.P.: Routing and wavelength assignment in optical networks. IEEE/ACM Transactions on Networking 11, 259–272 (2003)
Powers, J.: An introduction to Fiber Optic Systems, 2nd edn. McGraw-Hill, New York (1997)
Ramaswami, R., Sivarajan, K.N.: Routing and wavelength assignment in alloptical networks. IEEE/ACM Transactions on Networking 3, 489–499 (1995)
Schrijver, A., Seymour, P., Winkler, P.: The Ring Loading Problem. SIAM Journal on Discrete Math. 11, 1–14 (1998)
Sen, A., Deng, H., Guha, S.: On a graph partition problem with an application to VLSI layout. Information Processing Letters 24, 133–137 (1987)
Supowit, K.J.: Finding a maximum planar subset of a set of nets in a channel. IEEE Trans. on Computer Aided Design, CAD 6(1), 93–94 (1987)
Winkler, P., Zhang, L.: Wavelength Assignment and Generalized Interval Graph Coloring. In: Proc. Symposium on Discrete Algorithms (SODA), pp. 830–831 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alicherry, M., Bhatia, R. (2003). Line System Design and a Generalized Coloring Problem. In: Di Battista, G., Zwick, U. (eds) Algorithms - ESA 2003. ESA 2003. Lecture Notes in Computer Science, vol 2832. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39658-1_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-39658-1_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20064-2
Online ISBN: 978-3-540-39658-1
eBook Packages: Springer Book Archive