Probabilistic coloring of bipartite and split graphs

Lecture Notes in Computer Science

Volumn 3483, Issue IV, 2005, Pages 202-211

  Croce, F Della ^a   Escoffier, B ^b   Murat, C ^b   Paschos, V Th ^b  

^a POLITECNICO DI TORINO   (Italy)

^b UNIVERSITÉ PARIS DAUPHINE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; OPTIMAL CONTROL SYSTEMS; POLYNOMIALS; PROBABILITY;

OPTIMAL SOLUTION; POLYNOMIAL ALGORITHMS; POLYNOMIAL TIME APPROXIMATION; SPLIT GRAPHS;

GRAPH THEORY;

EID: 24944436395     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. Murat, G., Paschos, V. Th.: The probabilistic minimum coloring problem. Annales du LAMSADE 1, LAMSADE, Université Paris-Dauphine (2003) Available on http://~l1.lamsade.dauphine.fr/~paschos/documents/a1pc.pdf.
2. Murat, C., Paschos, V. Th.: The probabilistic minimum coloring problem. In Bodlaender, H.L., ed.: Proc. 29th International Workshop on Graph Theoretical Concepts in Computer Science, WG'03. Volume 2880 of Lecture Notes in Computer Science., Springer-Verlag (2003) 346-357
3. Averbakh, I., Berman, O., Simchi-Levi, D.: Probabilistic a priori routing-location problems. Naval Res. Logistics 41 (1994) 973-989
4. Bertsimas, D.J.: On probabilistic traveling salesman facility location problems. Transportation Sci. 3 (1989) 184-191
5. Bertsimas, D.J.: The probabilistic minimum spanning tree problem. Networks 20 (1990) 245-275
6. Bertsimas, D.J., Jaillet, P., Odoni, A.: A priori optimization. Oper. Res. 38 (1990) 1019-1033
7. Jaillet, P.: Probabilistic traveling salesman problem. Technical Report 185, Operations Research Center, MIT, Cambridge Mass., USA (1985)
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. Th.: The probabilistic minimum vertex-covering problem. Int. Trans. Opl Res. 9 (2002) 19-32
12. Murat, C., Paschos, V. Th.: The probabilistic longest path problem. Networks 33 (1999) 207-219
13. Murat, C., Paschos, V. Th.: A priori optimization for the probabilistic maximum independent set problem. Theoret. Comput. Sci. 270 (2002) 561-590
14. Delia Croce, F., Escoffier, B., Murat, C., Paschos, V. Th.: Probabilistic coloring of bipartite and split graphs. Cahier du LAMSADE 218, LAMSADE, Université Paris-Dauphine (2004)
15. Garey, M.R., Johnson, D.S.: Computers and intractability. A guide to the theory of NP-completeness. W. H. Freeman, San Francisco (1979)