{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:32:47Z","timestamp":1725564767264},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540204527"},{"type":"electronic","value":"9783540398905"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39890-5_30","type":"book-chapter","created":{"date-parts":[[2010,9,3]],"date-time":"2010-09-03T21:16:57Z","timestamp":1283548617000},"page":"346-357","source":"Crossref","is-referenced-by-count":4,"title":["The Probabilistic Minimum Coloring Problem"],"prefix":"10.1007","author":[{"given":"C\u00e9cile","family":"Murat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vangelis Th.","family":"Paschos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of computer computations","author":"R.M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of computer computations, pp. 85\u2013103. Plenum Press, New York (1972)"},{"key":"30_CR2","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)"},{"key":"30_CR3","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":"30_CR4","unstructured":"Jaillet, P.: Probabilistic traveling salesman problem. Technical Report 185, Operations Research Center, MIT, Cambridge Mass., USA (1985)"},{"key":"30_CR5","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":"30_CR6","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":"30_CR7","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":"30_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":"30_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":"30_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":"30_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":"30_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":"30_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":"30_CR14","unstructured":"Murat, C., Paschos, V.T.: The probabilistic minimum coloring problem. Annales du LAMSADE 1, LAMSADE, Universit\u00e9 Paris-Dauphine (2003), Available on \n                    \n                      http:\/\/www.lamsade.dauphine.fr\/cahdoc.html#cahiers"},{"key":"30_CR15","unstructured":"Demange, M., de Werra, D., Monnot, J., Paschos, V.T.: Time slot scheduling of compatible jobs. Cahier du LAMSADE 182, LAMSADE, Universit\u00e9 Paris- Dauphine (2001), Available on \n                    \n                      http:\/\/www.lamsade.dauphine.fr\/cahdoc.html#cahiers"},{"key":"30_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/3-540-36379-3_11","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M. Demange","year":"2002","unstructured":"Demange, M., de Werra, D., Monnot, J., Paschos, V.T.: Weighted node coloring: when stable sets are expensive. In: Ku\u010dera, L. (ed.) WG 2002. LNCS, vol.\u00a02573, pp. 114\u2013125. Springer, Heidelberg (2002)"},{"key":"30_CR17","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1006\/inco.1997.2677","volume":"140","author":"A. Bar-Noy","year":"1988","unstructured":"Bar-Noy, A., Bellare, M., Halld\u00f3rsson, M.M., Shachnai, H., Tamir, T.: On chromatic sums and distributed resource allocation. Inform. and Comput.\u00a0140, 183\u2013202 (1988)","journal-title":"Inform. and Comput."},{"key":"30_CR18","doi-asserted-by":"crossref","unstructured":"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\u2013168 (1997)","DOI":"10.1007\/3-540-63165-8_226"},{"key":"30_CR19","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/PL00009252","volume":"23","author":"S. Nicoloso","year":"1999","unstructured":"Nicoloso, S., Sarrafzadeh, M., Song, X.: On the sum coloring problem on interval graphs. Algorithmica\u00a023, 109\u2013126 (1999)","journal-title":"Algorithmica"},{"key":"30_CR20","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0020-0190(93)90246-6","volume":"45","author":"M.M. Halld\u00f3rsson","year":"1993","unstructured":"Halld\u00f3rsson, M.M.: A still better performance guarantee for approximate graph coloring. Inform. Process. Lett.\u00a045, 19\u201323 (1993)","journal-title":"Inform. Process. Lett."},{"key":"30_CR21","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0166-218X(94)90009-4","volume":"55","author":"H.L. Bodlaender","year":"1994","unstructured":"Bodlaender, H.L., Jansen, K., Woeginger, G.J.: Scheduling with incompatible jobs. Discrete Appl. Math.\u00a055, 219\u2013232 (1994)","journal-title":"Discrete Appl. Math."},{"key":"30_CR22","volume-title":"Combinatorial optimization: algorithms and complexity","author":"C.H. Papadimitriou","year":"1981","unstructured":"Papadimitriou, C.H., Steiglitz, K.: Combinatorial optimization: algorithms and complexity. Prentice Hall, New Jersey (1981)"},{"key":"30_CR23","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"D.S. Johnson","year":"1974","unstructured":"Johnson, D.S.: Approximation algorithms for combinatorial problems. J. Comput. System Sci.\u00a09, 256\u2013278 (1974)","journal-title":"J. Comput. System Sci."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39890-5_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,19]],"date-time":"2019-03-19T17:19:19Z","timestamp":1553015959000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39890-5_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540204527","9783540398905"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39890-5_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}