Solving Min Vertex Cover with Iterated Hopfield Networks

  • A. Bertoni
  • P. Campadelli
  • G. Grossi
Conference paper

DOI: 10.1007/978-1-4471-0219-9_5

Part of the Perspectives in Neural Computing book series (PERSPECT.NEURAL)
Cite this paper as:
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

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.

Keywords

Min Vertex Cover Hopfield networks approximation algorithms 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag London Limited 2002

Authors and Affiliations

  • A. Bertoni
    • 1
  • P. Campadelli
    • 1
  • G. Grossi
    • 1
  1. 1.Dipartimento di Scienze dell’InformazioneUniversità degli Studi di MilanoMilanoItaly

Personalised recommendations