{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,22]],"date-time":"2023-11-22T16:54:58Z","timestamp":1700672098869},"reference-count":16,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4215,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,1]]},"DOI":"10.1016\/s0304-3975(01)00005-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T06:05:14Z","timestamp":1027577114000},"page":"561-590","source":"Crossref","is-referenced-by-count":16,"title":["A priori optimization for the probabilistic maximum independent set problem"],"prefix":"10.1016","volume":"270","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":"78","reference":[{"key":"10.1016\/S0304-3975(01)00005-6_BIB1","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/S0304-3975(01)00005-6_BIB2","series-title":"Probabilistic combinatorial optimization problems, Ph.D. Thesis, Operations Research Center","author":"Bertsimas","year":"1988"},{"issue":"6","key":"10.1016\/S0304-3975(01)00005-6_BIB3","doi-asserted-by":"crossref","first-page":"1019","DOI":"10.1287\/opre.38.6.1019","article-title":"A priori optimization","volume":"38","author":"Bertsimas","year":"1990","journal-title":"Oper. Res."},{"key":"10.1016\/S0304-3975(01)00005-6_BIB4","series-title":"Random Graphs","author":"Bollob\u00e1s","year":"1985"},{"key":"10.1016\/S0304-3975(01)00005-6_BIB5","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1007\/BFb0121007","article-title":"Node-weighted graphs having the K\u00f6nig\u2013Egervary property","volume":"22","author":"Bourjolly","year":"1984","journal-title":"Math. Programming Stud."},{"key":"10.1016\/S0304-3975(01)00005-6_BIB6","unstructured":"M. Demange, V.T. Paschos, Maximum-weight independent set is as \u201cwell-approximated\u201d as the unweighted one, Tech. Report 163, LAMSADE, Universit\u00e9 Paris-Dauphine, 1999."},{"key":"10.1016\/S0304-3975(01)00005-6_BIB7","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1023\/A:1018920709696","article-title":"A new single model and derived algorithms for the satellite shot planning problem using graph theory concepts","volume":"69","author":"Gabrel","year":"1997","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0304-3975(01)00005-6_BIB8","series-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0304-3975(01)00005-6_BIB9","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/S0304-3975(01)00005-6_BIB10","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02392825","article-title":"Clique is hard to approximate within n1\u2212\u03b5","volume":"182","author":"H\u00e5stad","year":"1999","journal-title":"Acta Math."},{"key":"10.1016\/S0304-3975(01)00005-6_BIB11","unstructured":"P. Jaillet, Probabilistic traveling salesman problem, Tech. Report 185, Operations Research Center, MIT, Cambridge, MA, USA, 1985."},{"key":"10.1016\/S0304-3975(01)00005-6_BIB12","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1002\/net.3230220607","article-title":"Shortest path problems with node failures","volume":"22","author":"Jaillet","year":"1992","journal-title":"Networks"},{"key":"10.1016\/S0304-3975(01)00005-6_BIB13","unstructured":"C. Murat, Probabilistic combinatorial optimization graph-problems, Ph.D. Thesis, LAMSADE, Universit\u00e9 Paris-Dauphine, 1997 (in French)."},{"key":"10.1016\/S0304-3975(01)00005-6_BIB14","unstructured":"C. Murat, V.T. Paschos, The probabilistic minimum vertex covering problem, manuscript, LAMSADE, Universit\u00e9 Paris-Dauphine, Paris, France."},{"issue":"2","key":"10.1016\/S0304-3975(01)00005-6_BIB15","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1145\/254180.254190","article-title":"A survey about how optimal solutions to some covering and packing problems can be approximated","volume":"29","author":"Paschos","year":"1997","journal-title":"ACM Comput. Surveys"},{"key":"10.1016\/S0304-3975(01)00005-6_BIB16","first-page":"436","article-title":"On an extremal problem in graph theory","volume":"48","author":"Tur\u00e1n","year":"1941","journal-title":"Mat. Fiz. Lapok"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501000056?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501000056?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T06:23:11Z","timestamp":1556864591000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501000056"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":16,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,1]]}},"alternative-id":["S0304397501000056"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00005-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,1]]}}}