The probabilistic minimum coloring problem. (Extended Abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2880, Issue , 2003, Pages 346-357

  Murat, Cécile ^a   Paschos, Vangelis Th ^a  

^a UNIVERSITÉ PARIS DAUPHINE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; GRAPH THEORY; NP-HARD; POLYNOMIAL APPROXIMATION;

APPROXIMATION RATIOS; BIPARTITE GRAPHS; COLORING PROBLEMS; CONSTANT RATIO; EXTENDED ABSTRACTS; OBJECTIVE FUNCTIONS; OPTIMAL SOLUTIONS; POLYNOMIAL TIME APPROXIMATION ALGORITHMS;

POLYNOMIAL APPROXIMATION; APPROXIMATION ALGORITHMS;

EID: 0344823718     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39890-5_30     Document Type: Article

References (23)

1. Karp, R.M.: Reducibility among combinatorial problems. In Miller, R.E., Thatcher, J.W., eds.: Complexity of computer computations. Plenum Press, New York (1972) 85-103
2. Garey, M.R., Johnson, D.S.: Computers and intractability. A guide to the theory of NP-completeness. W. H. Freeman, San Francisco (1979)
3. Bertsimas, D.J., Jaillet, P., Odoni, A.: A priori optimization. Oper. Res. 38 (1990) 1019-1033
4. Jaillet, P.: Probabilistic traveling salesman problem. Technical Report 185, Operations Research Center, MIT, Cambridge Mass., USA (1985)
5. Averbakh, I., Berman, O., Simchi-Levi, D.: Probabilistic a priori routing-location problems. Naval Res. Logistics 41 (1994) 973-989
6. Bertsimas, D.J.: On probabilistic traveling salesman facility location problems. Transportation Sci. 3 (1989) 184-191
7. Bertsimas, D.J.: The probabilistic minimum spanning tree problem. Networks 20 (1990) 245-275
8. Jaillet, P.: A priori solution of a traveling salesman problem in which a random subset of the customers are visited. Oper. Res. 36 (1988) 929-936
9. Jaillet, P.: Shortest path problems with node failures. Networks 22 (1992) 589-605
10. 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)
11. Murat, C., Paschos, V.T.: The probabilistic minimum vertex-covering problem. Int. Trans. Opl Res. 9 (2002) 19-32
12. Murat, C., Paschos, V.T.: The probabilistic longest path problem. Networks 33 (1999) 207-219
13. Murat, C., Paschos, V.T.: A priori optimization for the probabilistic maximum independent set problem. Theoret. Comput. Sci. 270 (2002) 561-590
14. 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.
15. 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.
16. Demange, M., de Werra, D., Monnot, J., Paschos, V.T.: Weighted node coloring: when stable sets are expensive. In Kučera, L., ed.: Proc. 28th International Workshop on Graph Theoretical Concepts in Computer Science, WG'02. Volume 2573 of Lecture Notes in Computer Science., Springer-Verlag (2002) 114-125
17. Bar-Noy, A., Bellare, M., Halldorsson, M.M., Shachnai, H., Tamir, T.: On chromatic sums and distributed resource allocation. Inform, and Comput. 140 (1988) 183-202
18. 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. (1997) 143-168
19. Nicoloso, S., Sarrafzadeh, M., Song, X.: On the sum coloring problem on interval graphs. Algorithmica 23 (1999) 109-126
20. Halldórsson, M.M.: A still better performance guarantee for approximate graph coloring. Inform. Process. Lett. 45 (1993) 19-23
21. Bodlaender, H.L., Jansen, K., Woeginger, G.J.: Scheduling with incompatible jobs. Discrete Appl. Math. 55 (1994) 219-232
22. Papadimitriou, C.H., Steiglitz, K.: Combinatorial optimization: algorithms and complexity. Prentice Hall, New Jersey (1981)
23. Johnson, D.S.: Approximation algorithms for combinatorial problems. J. Comput. System Sci. 9 (1974) 256-278