Abstract
We study the multicoloring problem with two objective functions: minimizing the makespan and minimizing the multisum. We focus on partial k-trees and planar graphs. In particular, we give polynomial time approximation schemes (PTAS) for both classes, for both preemptive and non-preemptive multisum colorings.
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
Bodlaender, H.L.: Planar Graphs with Bounded Treewidth. Tech. Report RUU-CS-88-14, Dept. of Comp. Sci., Univ. of Utrecht (March 1988)
Bell, M.: Future directions in traffic signal control. Transportation Research Part A 26, 303–313 (1992)
Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. J. ACM 41, 153–180 (1994)
Bar-Noy, A., Bellare, M., Halldórsson, M.M., Shachnai, H., Tamir, T.: On chromatic sums and distributed resource allocation. Information and Computation 140, 183–202 (1998)
Bullock, D., Hendrickson, C.: Roadway traffic control software. IEEE Transactions on Control Systems Technology 2, 255–264 (1994)
Bar-Noy, A., Kortsarz, G.: The minimum color-sum of bipartite graphs. Journal of Algorithms 28, 339–365 (1998)
Bar-Noy, A., Halldórsson, M.M., Kortsarz, G., Shachnai, H., Salman, R.: Sum Multi-Coloring of Graphs. In: Nešetřil, J. (ed.) ESA 1999. LNCS, vol. 1643, pp. 390–401. Springer, Heidelberg (1999) (To appear)
Chen, J., Cidon, I., Ofek, Y.: A local fairness algorithm for gigabit LANs/MANs with spatial reuse. IEEE Journal on Selected Areas in Communications 11, 1183–1192 (1993)
Feige, U., Kilian, J.: Zero Knowledge and the Chromatic number. Journal of Computer and System Sciences 57(2), 187–199 (1998)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. W. H. Freeman, New York (1979)
Halldórsson, M.M., Kortsarz, G.: Multicoloring Planar Graphs and Partial k-Trees At http://www.raunvis.hi.is/~mmh/publications.html
Halldórsson, M.M., Kortsarz, G., Proskurowski, A., Salman, R., Shachnai, H., Telle, J.A.: Multi-Coloring Trees. In: Asano, T., Imai, H., Lee, D.T., Nakano, S.-i., Tokuyama, T. (eds.) COCOON 1999. LNCS, vol. 1627, p. 271. Springer, Heidelberg (1999)
Jansen, K.: The Optimum Cost Chromatic Partition Problem. In: Bongiovanni, G., Bovet, D.P., Di Battista, G. (eds.) CIAC 1997. LNCS. vol. 1203, Springer, Heidelberg (1997)
Kubicka, E., Schwenk, A.J.: An Introduction to Chromatic Sums. In: Proceedings of the ACM Computer Science Conf., pp. 39–45 (1989)
McDiarmid, C., Reed, B.: Channel assignment and weighted coloring. Manuscript (1997)
Narayanan, L., Shende, S.: Static Frequency Assignment in Cellular Networks. Manuscript (1997)
Nicoloso, S., Sarrafzadeh, M., Song, X.: On the Sum Coloring Problem on Interval Graphs. Algorithmica 23, 109–126 (1999)
Silberschatz, A., Galvin, P.: Operating System Concepts, 5th edn. Addison-Wesley, Reading (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Halldórsson, M.M., Kortsarz, G. (1999). Multicoloring Planar Graphs and Partial k-Trees. In: Hochbaum, D.S., Jansen, K., Rolim, J.D.P., Sinclair, A. (eds) Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques. RANDOM APPROX 1999 1999. Lecture Notes in Computer Science, vol 1671. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48413-4_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-48413-4_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66329-4
Online ISBN: 978-3-540-48413-4
eBook Packages: Springer Book Archive