{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:27:15Z","timestamp":1725575235145},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540258636"},{"type":"electronic","value":"9783540323099"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11424925_23","type":"book-chapter","created":{"date-parts":[[2011,1,15]],"date-time":"2011-01-15T16:14:27Z","timestamp":1295108067000},"page":"202-211","source":"Crossref","is-referenced-by-count":3,"title":["Probabilistic Coloring of Bipartite and Split Graphs"],"prefix":"10.1007","author":[{"given":"F.","family":"Della Croce","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Escoffier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Murat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V. Th.","family":"Paschos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Murat, C., Paschos, V.T.: 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","DOI":"10.1007\/978-3-540-39890-5_30"},{"key":"23_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/978-3-540-39890-5_30","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"C. Murat","year":"2003","unstructured":"Murat, C., Paschos, V.T.: The probabilistic minimum coloring problem. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol.\u00a02880, pp. 346\u2013357. Springer, Heidelberg (2003)"},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1002\/1520-6750(199412)41:7<973::AID-NAV3220410709>3.0.CO;2-H","volume":"41","author":"I. Averbakh","year":"1994","unstructured":"Averbakh, I., Berman, O., Simchi-Levi, D.: Probabilistic a priori routing-location problems. Naval Res. Logistics\u00a041, 973\u2013989 (1994)","journal-title":"Naval Res. Logistics"},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1287\/trsc.23.3.184","volume":"3","author":"D.J. Bertsimas","year":"1989","unstructured":"Bertsimas, D.J.: On probabilistic traveling salesman facility location problems. Transportation Sci.\u00a03, 184\u2013191 (1989)","journal-title":"Transportation Sci."},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1002\/net.3230200302","volume":"20","author":"D.J. Bertsimas","year":"1990","unstructured":"Bertsimas, D.J.: The probabilistic minimum spanning tree problem. Networks\u00a020, 245\u2013275 (1990)","journal-title":"Networks"},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1287\/opre.38.6.1019","volume":"38","author":"D.J. Bertsimas","year":"1990","unstructured":"Bertsimas, D.J., Jaillet, P., Odoni, A.: A priori optimization. Oper. Res.\u00a038, 1019\u20131033 (1990)","journal-title":"Oper. Res."},{"key":"23_CR7","unstructured":"Jaillet, P.: Probabilistic traveling salesman problem. Technical Report 185, Operations Research Center, MIT, Cambridge Mass, USA (1985)"},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1287\/opre.36.6.929","volume":"36","author":"P. Jaillet","year":"1988","unstructured":"Jaillet, P.: A priori solution of a traveling salesman problem in which a random subset of the customers are visited. Oper. Res.\u00a036, 929\u2013936 (1988)","journal-title":"Oper. Res."},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1002\/net.3230220607","volume":"22","author":"P. Jaillet","year":"1992","unstructured":"Jaillet, P.: Shortest path problems with node failures. Networks\u00a022, 589\u2013605 (1992)","journal-title":"Networks"},{"key":"23_CR10","volume-title":"Vehicle routing: methods and studies","author":"P. Jaillet","year":"1988","unstructured":"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)"},{"key":"23_CR11","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1111\/1475-3995.00338","volume":"9","author":"C. Murat","year":"2002","unstructured":"Murat, C., Paschos, V.T.: The probabilistic minimum vertex-covering problem. Int. Trans. Opl Res.\u00a09, 19\u201332 (2002)","journal-title":"Int. Trans. Opl Res."},{"key":"23_CR12","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1002\/(SICI)1097-0037(199905)33:3<207::AID-NET7>3.0.CO;2-7","volume":"33","author":"C. Murat","year":"1999","unstructured":"Murat, C., Paschos, V.T.: The probabilistic longest path problem. Networks\u00a033, 207\u2013219 (1999)","journal-title":"Networks"},{"key":"23_CR13","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1016\/S0304-3975(01)00005-6","volume":"270","author":"C. Murat","year":"2002","unstructured":"Murat, C., Paschos, V.T.: A priori optimization for the probabilistic maximum independent set problem. Theoret. Comput. Sci.\u00a0270, 561\u2013590 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Della Croce, F., Escoffier, B., Murat, C., Paschos, V.T.: Probabilistic coloring of bipartite and split graphs. Cahier du LAMSADE 218, LAMSADE, Universit Paris-Dauphine (2004)","DOI":"10.1007\/11424925_23"},{"key":"23_CR15","volume-title":"Computers and intractability. A guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability. A guide to the theory of NP-completeness. W. H. Freeman, San Francisco (1979)"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11424925_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,17]],"date-time":"2021-11-17T13:21:51Z","timestamp":1637155311000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11424925_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540258636","9783540323099"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11424925_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}