{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T16:59:15Z","timestamp":1725728355616},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642385353"},{"type":"electronic","value":"9783642385360"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38536-0_26","type":"book-chapter","created":{"date-parts":[[2013,6,2]],"date-time":"2013-06-02T21:03:04Z","timestamp":1370206984000},"page":"298-309","source":"Crossref","is-referenced-by-count":0,"title":["The Probabilistic Min Dominating Set Problem"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Boria","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C\u00e9cile","family":"Murat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vangelis Th.","family":"Paschos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","first-page":"436","volume":"4","author":"A.C. Sandos","year":"2009","unstructured":"Sandos, A.C., Bendali, F., Mailfert, J., Duhamel, C., Hou, K.M.: Heuristics for designing energy-efficient wireless sensor network topologies. J. Networks\u00a04, 436\u2013444 (2009)","journal-title":"J. Networks"},{"unstructured":"Jaillet, P.: Probabilistic traveling salesman problem. Technical Report 185, Operations Research Center. MIT, Cambridge Mass., USA (1985)","key":"26_CR2"},{"unstructured":"Bertsimas, D.J.: Probabilistic combinatorial optimization problems. Phd thesis, Operations Research Center. MIT, Cambridge Mass., USA (1988)","key":"26_CR3"},{"key":"26_CR4","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":"26_CR5","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":"26_CR6","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":"26_CR7","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":"26_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":"26_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"},{"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":"26_CR10"},{"key":"26_CR11","doi-asserted-by":"publisher","first-page":"1939","DOI":"10.1016\/j.cor.2009.12.005","volume":"37","author":"P. Balaprakash","year":"2010","unstructured":"Balaprakash, P., Birattari, M., St\u00fctzle, T., Dorigo, M.: Estimation-based metaheuristics for the probabilistic traveling salesman problem. Computers and Operations Research\u00a037, 1939\u20131951 (2010)","journal-title":"Computers and Operations Research"},{"key":"26_CR12","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1016\/j.ejor.2003.10.016","volume":"161","author":"L. Bianchi","year":"2005","unstructured":"Bianchi, L., Knowles, J., Bowler, N.: Local search for the probabilistic traveling salesman problem: correlation to the 2-p-opt and 1-shift algorithms. European J.\u00a0Oper. Res.\u00a0161, 206\u2013219 (2005)","journal-title":"European J.\u00a0Oper. Res."},{"key":"26_CR13","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1287\/ijoc.1080.0276","volume":"20","author":"M. Birattari","year":"2008","unstructured":"Birattari, M., Balaprakash, P., St\u00fctzle, T., Dorigo, M.: Estimation-based local search for stochastic combinatorial optimization using delta evaluations: a case study on the probabilistic traveling salesman problem. INFORMS J. Computing\u00a020, 644\u2013658 (2008)","journal-title":"INFORMS J. Computing"},{"key":"26_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/trsc.1070.0203","volume":"42","author":"A.M. Campbell","year":"2008","unstructured":"Campbell, A.M., Thomas, B.W.: Probabilistic traveling salesman problem with deadlines. Transportation Sci.\u00a042, 1\u201321 (2008)","journal-title":"Transportation Sci."},{"key":"26_CR15","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1016\/j.dam.2005.06.007","volume":"154","author":"C. Murat","year":"2006","unstructured":"Murat, C., Paschos, V.T.: On the probabilistic minimum coloring and minimum k-coloring. Discrete Appl. Math.\u00a0154, 564\u2013586 (2006)","journal-title":"Discrete Appl. Math."},{"key":"26_CR16","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/s10878-007-9112-2","volume":"17","author":"N. Bourgeois","year":"2009","unstructured":"Bourgeois, N., Della Croce, F., Escoffier, B., Murat, C., Paschos, V.T.: Probabilistic coloring of bipartite and split graphs. J. Comb. Optimization\u00a017, 274\u2013311 (2009)","journal-title":"J. Comb. Optimization"},{"key":"26_CR17","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":"26_CR18","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":"26_CR19","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":"26_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-540-73556-4_14","volume-title":"Combinatorial Optimization and Applications","author":"V.T. Paschos","year":"2007","unstructured":"Paschos, V.T., Telelis, O.A., Zissimopoulos, V.: Steiner forests on stochastic metric graphs. In: Dress, A.W.M., Xu, Y., Zhu, B. (eds.) COCOA. LNCS, vol.\u00a04616, pp. 112\u2013123. Springer, Heidelberg (2007)"},{"key":"26_CR21","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1002\/net.20346","volume":"56","author":"V.T. Paschos","year":"2010","unstructured":"Paschos, V.T., Telelis, O.A., Zissimopoulos, V.: Probabilistic models for the steiner tree problem. Networks\u00a056, 39\u201349 (2010)","journal-title":"Networks"},{"unstructured":"Boria, N., Murat, C., Paschos, V.T.: On the probabilistic min spanning tree problem. J. Mathematical Modelling and Algorithms (to appear)","key":"26_CR22"},{"key":"26_CR23","doi-asserted-by":"publisher","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)"},{"unstructured":"Boria, N., Murat, C., Paschos, V.T.: An emergency management model for a wireless sensor network problem. In: Cahier du LAMSADE 325, LAMSADE, Universit\u00e9 Paris-Dauphine (2012)","key":"26_CR24"},{"key":"26_CR25","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.\u00a0Comput. System Sci.\u00a09, 256\u2013278 (1974)","journal-title":"J.\u00a0Comput. System Sci."},{"key":"26_CR26","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","volume":"13","author":"L. Lov\u00e1sz","year":"1975","unstructured":"Lov\u00e1sz, L.: On the ratio of optimal integral and fractional covers. Discrete Math.\u00a013, 383\u2013390 (1975)","journal-title":"Discrete Math."},{"doi-asserted-by":"crossref","unstructured":"Slav\u00edk, P.: A tight analysis of the greedy algorithm for set cover. In: Proc. STOC 1996, pp. 435\u2013441 (1996)","key":"26_CR27","DOI":"10.1145\/237814.237991"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38536-0_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,27]],"date-time":"2020-07-27T11:09:20Z","timestamp":1595848160000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38536-0_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385353","9783642385360"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38536-0_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}