Abstract
A neural approximation algorithm for the Min Vertex Cover problem is designed and analyzed. This algorithm, having in input a graphs G = (V, E), constructs a sequence of Hopfield networks such that the attractor of the last one represents a minimal vertex cover of G. We prove a theoretical upper bound to the sequence length and experimentally compare on random graphs the performances (quality of solutions, computation time) of the algorithm with those of other known heuristics. The experiments show that the quality of the solutions found by the neural algorithm is quite satisfactory.
Supported by MURST project (60%): Disegno e Analisi di Algoritmi.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Bertoni, P. Campadelli, and G. Grossi. A neural algorithm for the maximum clique problem: Analysis, experiments and circuit implementation. Algoritmica. (To appear).
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.
F. Gavril. Quoted in [2], pag. 134.
J. Håstad. Some optimal inapproximability results. In M. Sipser, editor, Proceedings of the 29th ACM Symposium on the Theory of Computation, pages 1–10, New York, NY, 1997. ACM Press.
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–2558, 1982.
A. Jagota. Approximating maximum clique with a Hopfield network. Technical Report 92–33, Department of Computer Science, SUNY Buffalo, December 1992.
R. M. Karp. Reducibility among Combinatorial Problems, pages 85–103. Complexity of Computer Computations. Plenum Press, New York, 1972.
Clarkson K. L. A modification of the greedy algorithm for vertex cover. Information Processing Letters, (16):23–25, 1983.
Bar-Yehuda R. and S. Even. A local-ratio theorem for approximating the weighted vertex cover problem. Annals of Discrete Mathematics, (25):27–45, 1985.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag London Limited
About this paper
Cite this paper
Bertoni, A., Campadelli, P., Grossi, G. (2002). Solving Min Vertex Cover with Iterated Hopfield Networks. In: Tagliaferri, R., Marinaro, M. (eds) Neural Nets WIRN Vietri-01. Perspectives in Neural Computing. Springer, London. https://doi.org/10.1007/978-1-4471-0219-9_5
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0219-9_5
Publisher Name: Springer, London
Print ISBN: 978-1-85233-505-2
Online ISBN: 978-1-4471-0219-9
eBook Packages: Springer Book Archive