乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T20:20:24Z","timestamp":1648585224825},"reference-count":20,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"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":4764,"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":[[2000,7]]},"DOI":"10.1016\/s0304-3975(98)90214-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:23:10Z","timestamp":1027614190000},"page":"269-288","source":"Crossref","is-referenced-by-count":9,"title":["Alarm placement in systems with fault propagation"],"prefix":"10.1016","volume":"243","author":[{"given":"K.B.","family":"Lakshmanan","sequence":"first","affiliation":[]},{"given":"Daniel J.","family":"Rosenkrantz","sequence":"additional","affiliation":[]},{"given":"S.S.","family":"Ravi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)90214-6_BIB1","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1137\/0201008","article-title":"The transitive reduction of a directed graph","volume":"1","author":"Aho","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(98)90214-6_BIB2","doi-asserted-by":"crossref","unstructured":"S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy, Proof verification and intractability of approximation problems, Proc. 33rd IEEE FOCS, 1992 pp. 14\u201323.","DOI":"10.1109\/SFCS.1992.267823"},{"key":"10.1016\/S0304-3975(98)90214-6_BIB3","series-title":"Introduction to Algorithms","author":"Cormen","year":"1990"},{"key":"10.1016\/S0304-3975(98)90214-6_BIB4","unstructured":"P. Crescenzi, V. Kann, A compendium of NP optimization problems, ftp.nada.kth.se, pub\/documents\/Theory\/Viggo-Kann\/compendium.ps, 1995."},{"key":"10.1016\/S0304-3975(98)90214-6_BIB5","doi-asserted-by":"crossref","unstructured":"U. Feige, A threshold of lnn for approximating set cover, Proc. 28th Ann. ACM STOC, Philadelphia, PA, 1996, pp. 314\u2013318.","DOI":"10.1145\/237814.237977"},{"key":"10.1016\/S0304-3975(98)90214-6_BIB6","unstructured":"M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA, 1979."},{"key":"10.1016\/S0304-3975(98)90214-6_BIB7","series-title":"Structural Models: An Introduction to the Theory of Directed Graphs","author":"Harary","year":"1965"},{"key":"10.1016\/S0304-3975(98)90214-6_BIB8","unstructured":"T. Ibaraki, T. Kameda, S. Toida, NP-Complete diagnosis problems on system graphs, Trans. IECE Japan E-62 (1979) 81\u201388."},{"key":"10.1016\/S0304-3975(98)90214-6_BIB9","unstructured":"V. Kann, On the approximability of NP-complete optimization problems, Ph.D. Thesis, Department of Numerical Analysis and Computing Science, Royal Institute of Technology, Stockholm, 1992."},{"key":"10.1016\/S0304-3975(98)90214-6_BIB10","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1016\/0005-1098(83)90039-0","article-title":"Fault location using digraph and inverse direction search with applications","volume":"19","author":"Kokawa","year":"1983","journal-title":"Automatica"},{"key":"10.1016\/S0304-3975(98)90214-6_BIB11","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/0005-1098(82)90094-2","article-title":"Failure propagating simulation and nonfailure paths search in network systems","volume":"18","author":"Kokawa","year":"1982","journal-title":"Automatica"},{"key":"10.1016\/S0304-3975(98)90214-6_BIB12","doi-asserted-by":"crossref","unstructured":"P.G. Kolaitis, M.N. Thakur, Approximation properties of NP minimization classes, Proc. 6th Ann. Conf. on Structures in Complexity Theory, 1991, pp. 353\u2013366.","DOI":"10.1109\/SCT.1991.160280"},{"key":"10.1016\/S0304-3975(98)90214-6_BIB13","doi-asserted-by":"crossref","first-page":"960","DOI":"10.1145\/185675.306789","article-title":"On the hardness of approximating minimization problems","volume":"41","author":"Lund","year":"1994","journal-title":"JACM"},{"key":"10.1016\/S0304-3975(98)90214-6_BIB14","first-page":"155","article-title":"Graph theory models in fault diagnosis and fault tolerance","volume":"3","author":"Malek","year":"1979","journal-title":"Design Automation Fault-Tolerant Comput."},{"key":"10.1016\/S0304-3975(98)90214-6_BIB15","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1109\/TCT.1969.1083003","article-title":"Distinguishability criteria in oriented graphs and its application to computer diagnosis-I","volume":"16","author":"Mayeda","year":"1969","journal-title":"IEEE Trans. Circuit Theory"},{"key":"10.1016\/S0304-3975(98)90214-6_BIB16","doi-asserted-by":"crossref","first-page":"848","DOI":"10.1109\/PGEC.1967.264748","article-title":"On the connection assignment problem of diagnosable systems","volume":"16","author":"Preparata","year":"1967","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0304-3975(98)90214-6_BIB17","doi-asserted-by":"crossref","first-page":"1071","DOI":"10.1109\/21.120059","article-title":"Computational complexity issues in synthesis of simple distributed detection networks","volume":"21","author":"Rao","year":"1991","journal-title":"IEEE Trans. Systems Man and Cybernet"},{"key":"10.1016\/S0304-3975(98)90214-6_BIB18","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1109\/12.210170","article-title":"Expected-value analysis of two single fault diagnosis algorithms","volume":"42","author":"Rao","year":"1993","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0304-3975(98)90214-6_BIB19","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1109\/12.214691","article-title":"Computational complexity issues in operative diagnosis of graph-based systems","volume":"42","author":"Rao","year":"1993","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0304-3975(98)90214-6_BIB20","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0098-1354(85)80006-5","article-title":"An improved algorithm for diagnosis of system failures in the chemical process","volume":"9","author":"Shiozaki","year":"1985","journal-title":"Comp. Chem. Eng."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598902146?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598902146?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T08:50:05Z","timestamp":1578732605000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598902146"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":20,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,7]]}},"alternative-id":["S0304397598902146"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)90214-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}