Abstract
We study the probabilistic coloring problem (pcolor) under a modification strategy consisting, given an a priori solution C, of removing the absent vertices from C. We compute the objective function associated with this strategy, we give bounds on its value, we characterize the complexity of computing it and the one of computing the optimal solution associated with. We show that pcolor is NP-hard and design a polynomial time approximation algorithm achieving non-trivial approximation ratio. We then show that probabilistic coloring remains NP-hard even in bipartite graphs and that the unique 2-coloring in such graphs is a constant ratio approximation. We finally prove that pcolor is polynomial when dealing with complements of bipartite graphs.
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
Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of computer computations, pp. 85–103. Plenum Press, New York (1972)
Garey, M.R., Johnson, D.S.: Computers and intractability. A guide to the theory of NP-completeness. W. H. Freeman, San Francisco (1979)
Bertsimas, D.J., Jaillet, P., Odoni, A.: A priori optimization. Oper. Res. 38, 1019–1033 (1990)
Jaillet, P.: Probabilistic traveling salesman problem. Technical Report 185, Operations Research Center, MIT, Cambridge Mass., USA (1985)
Averbakh, I., Berman, O., Simchi-Levi, D.: Probabilistic a priori routing-location problems. Naval Res. Logistics 41, 973–989 (1994)
Bertsimas, D.J.: On probabilistic traveling salesman facility location problems. Transportation Sci. 3, 184–191 (1989)
Bertsimas, D.J.: The probabilistic minimum spanning tree problem. Networks 20, 245–275 (1990)
Jaillet, P.: A priori solution of a traveling salesman problem in which a random subset of the customers are visited. Oper. Res. 36, 929–936 (1988)
Jaillet, P.: Shortest path problems with node failures. Networks 22, 589–605 (1992)
Jaillet, P., Odoni, A.: The probabilistic vehicle routing problem. In: Golden, B.L., Assad, A.A. (eds.) Vehicle routing: methods and studies, North Holland, Amsterdam (1988)
Murat, C., Paschos, V.T.: The probabilistic minimum vertex-covering problem. Int. Trans. Opl. Res. 9, 19–32 (2002)
Murat, C., Paschos, V.T.: The probabilistic longest path problem. Networks 33, 207–219 (1999)
Murat, C., Paschos, V.T.: A priori optimization for the probabilistic maximum independent set problem. Theoret. Comput. Sci. 270, 561–590 (2002)
Murat, C., Paschos, V.T.: The probabilistic minimum coloring problem. Annales du LAMSADE 1, LAMSADE, Université Paris-Dauphine (2003), Available on http://www.lamsade.dauphine.fr/cahdoc.html#cahiers
Demange, M., de Werra, D., Monnot, J., Paschos, V.T.: Time slot scheduling of compatible jobs. Cahier du LAMSADE 182, LAMSADE, Université Paris- Dauphine (2001), Available on http://www.lamsade.dauphine.fr/cahdoc.html#cahiers
Demange, M., de Werra, D., Monnot, J., Paschos, V.T.: Weighted node coloring: when stable sets are expensive. In: Kučera, L. (ed.) WG 2002. LNCS, vol. 2573, pp. 114–125. Springer, Heidelberg (2002)
Bar-Noy, A., Bellare, M., Halldórsson, M.M., Shachnai, H., Tamir, T.: On chromatic sums and distributed resource allocation. Inform. and Comput. 140, 183–202 (1988)
Jansen, K.: Approximation results for the optimum cost chromatic partition problem. In: Pardalos, P.M., Du, D. (eds.) Theoretical Computer Science, Network Design: Connectivity and Facilities Location, pp. 143–168 (1997)
Nicoloso, S., Sarrafzadeh, M., Song, X.: On the sum coloring problem on interval graphs. Algorithmica 23, 109–126 (1999)
Halldórsson, M.M.: A still better performance guarantee for approximate graph coloring. Inform. Process. Lett. 45, 19–23 (1993)
Bodlaender, H.L., Jansen, K., Woeginger, G.J.: Scheduling with incompatible jobs. Discrete Appl. Math. 55, 219–232 (1994)
Papadimitriou, C.H., Steiglitz, K.: Combinatorial optimization: algorithms and complexity. Prentice Hall, New Jersey (1981)
Johnson, D.S.: Approximation algorithms for combinatorial problems. J. Comput. System Sci. 9, 256–278 (1974)
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
Murat, C., Paschos, V.T. (2003). The Probabilistic Minimum Coloring Problem. In: Bodlaender, H.L. (eds) Graph-Theoretic Concepts in Computer Science. WG 2003. Lecture Notes in Computer Science, vol 2880. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39890-5_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-39890-5_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20452-7
Online ISBN: 978-3-540-39890-5
eBook Packages: Springer Book Archive