{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:55:37Z","timestamp":1725566137158},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540228417"},{"type":"electronic","value":"9783540286479"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-28647-9_72","type":"book-chapter","created":{"date-parts":[[2010,9,21]],"date-time":"2010-09-21T22:30:42Z","timestamp":1285108242000},"page":"430-435","source":"Crossref","is-referenced-by-count":1,"title":["An Algorithm Based on Hopfield Network Learning for Minimum Vertex Cover Problem"],"prefix":"10.1007","author":[{"given":"Xiaoming","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zheng","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinshun","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Songsong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guangpu","family":"Xia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiahai","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"72_CR1","unstructured":"Khuri, S., Back, T.: An Evolutionary Heuristic for the Minimum Vertex Cover Problem. In: KI-1994 Workshops, Bonn, pp. 83\u201384 (1994) (extended abstracts)"},{"key":"72_CR2","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Reducibility Among Combinatorial Problems. Complexity of Computer Computation","author":"R.M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility Among Combinatorial Problems. Complexity of Computer Computation, pp. 85\u2013103. Plenum Press, New York (1972)"},{"key":"72_CR3","unstructured":"Dehne, F., et al.: Solving Large FPT Problems on Coarse Grained Parallel Machines. Available: http:\/\/www.scs.carleton.ca\/~fpt\/papers\/index.htm"},{"key":"72_CR4","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0166-218X(93)E0140-T","volume":"58","author":"L.A. Sanchis","year":"1995","unstructured":"Sanchis, L.A.: Generating Hard and Diverse Test Sets for NP-hard Graph Problems. Discrete Applied Mathematics\u00a058, 35\u201366 (1995)","journal-title":"Discrete Applied Mathematics"},{"key":"72_CR5","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00339943","volume":"52","author":"J.J. Hopfield","year":"1985","unstructured":"Hopfield, J.J., Tank, D.W.: Neural Computation of Decisions in Optimization Problems. Bio. Cybern.\u00a052, 141\u2013152 (1985)","journal-title":"Bio. Cybern."},{"key":"72_CR6","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0304-3975(94)00097-3","volume":"141","author":"R.G. Downey","year":"1995","unstructured":"Downey, R.G., Fellows, M.R.: Fixed Parameter Tractability and Completeness II: Completeness for W [1]. Theoretical Computer Science\u00a0141, 109\u2013131 (1995)","journal-title":"Theoretical Computer Science"},{"key":"72_CR7","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1090\/dimacs\/015\/21","volume":"15","author":"L.A. Sanchis","year":"1994","unstructured":"Sanchis, L.A.: Test Case Construction for the Vertex Cover Problem. DIMACS Series in Discrete Mathematics and Theoretical Computer Science\u00a015, 315\u2013326 (1994)","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"issue":"4","key":"72_CR8","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1541\/ieejeiss1987.122.4_677","volume":"122","author":"Q.P. Cao","year":"2002","unstructured":"Cao, Q.P., Tang, Z., Wang, R.L.: A Gradient Ascent Learning Algorithm in Weight Domain for Hopfield Neural Network. IEEJ Trans. EIS\u00a0122(4), 677\u2013683 (2002)","journal-title":"IEEJ Trans. EIS"}],"container-title":["Lecture Notes in Computer Science","Advances in Neural Networks \u2013 ISNN 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-28647-9_72.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,3]],"date-time":"2023-06-03T12:24:11Z","timestamp":1685795051000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-28647-9_72"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228417","9783540286479"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-28647-9_72","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}