{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T08:32:25Z","timestamp":1725611545811},"publisher-location":"London","reference-count":9,"publisher":"Springer London","isbn-type":[{"type":"print","value":"9781852335052"},{"type":"electronic","value":"9781447102199"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/978-1-4471-0219-9_5","type":"book-chapter","created":{"date-parts":[[2011,9,20]],"date-time":"2011-09-20T07:55:12Z","timestamp":1316505312000},"page":"87-95","source":"Crossref","is-referenced-by-count":1,"title":["Solving Min Vertex Cover with Iterated Hopfield Networks"],"prefix":"10.1007","author":[{"given":"A.","family":"Bertoni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Campadelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Grossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"A. Bertoni, P. Campadelli, and G. Grossi. A neural algorithm for the maximum clique problem: Analysis, experiments and circuit implementation. Algoritmica. (To appear).","DOI":"10.1007\/s00453-001-0105-8"},{"key":"5_CR2","volume-title":"Computers and Intractability. A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability. A Guide to the Theory of NP-Completeness. W. H. Freeman k Co., San Francisco, CA, 1979."},{"key":"5_CR3","unstructured":"F. Gavril. Quoted in [2], pag. 134."},{"key":"5_CR4","first-page":"1","volume-title":"Proceedings of the 29th ACM Symposium on the Theory of Computation","author":"J H\u00e5stad","year":"1997","unstructured":"J. H\u00e5stad. Some optimal inapproximability results. In M. Sipser, editor, Proceedings of the 29th ACM Symposium on the Theory of Computation, pages 1\u201310, New York, NY, 1997. ACM Press."},{"issue":"8","key":"5_CR5","doi-asserted-by":"publisher","first-page":"2554","DOI":"10.1073\/pnas.79.8.2554","volume":"79","author":"JJ Hopfield","year":"1982","unstructured":"J. J. Hopfield. Neural networks and physical systems with emergent collective computational abilities. Proceedings of the National Academy of Sciences of the United States of America, 79(8):2554\u20132558, 1982.","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"key":"5_CR6","series-title":"Technical Report","first-page":"92","volume-title":"Approximating maximum clique with a Hopfield network","author":"A Jagota","year":"1992","unstructured":"A. Jagota. Approximating maximum clique with a Hopfield network. Technical Report 92\u201333, Department of Computer Science, SUNY Buffalo, December 1992."},{"key":"5_CR7","first-page":"85","volume-title":"Reducibility among Combinatorial Problems","author":"RM Karp","year":"1972","unstructured":"R. M. Karp. Reducibility among Combinatorial Problems, pages 85\u2013103. Complexity of Computer Computations. Plenum Press, New York, 1972."},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0020-0190(83)90007-8","volume":"16","author":"KL Clarkson","year":"1983","unstructured":"Clarkson K. L. A modification of the greedy algorithm for vertex cover. Information Processing Letters, (16):23\u201325, 1983.","journal-title":"Information Processing Letters"},{"key":"5_CR9","first-page":"27","volume":"25","author":"R Bar-Yehuda","year":"1985","unstructured":"Bar-Yehuda R. and S. Even. A local-ratio theorem for approximating the weighted vertex cover problem. Annals of Discrete Mathematics, (25):27\u201345, 1985.","journal-title":"Annals of Discrete Mathematics"}],"container-title":["Perspectives in Neural Computing","Neural Nets WIRN Vietri-01"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4471-0219-9_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,1]],"date-time":"2021-05-01T00:53:48Z","timestamp":1619830428000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4471-0219-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9781852335052","9781447102199"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-1-4471-0219-9_5","relation":{},"ISSN":["1431-6854"],"issn-type":[{"type":"print","value":"1431-6854"}],"subject":[],"published":{"date-parts":[[2002]]}}}