Approximating Minimum Set Cover in a Hopfield-Style Network

Information Sciences

Volumn 98, Issue 1-4, 1997, Pages 203-216

  Kaznachey, Dmitri ^a,b   Jagota, Arun ^c  

^a University of Memphis   (United States)

^b ST JUDE CHILDREN S RESEARCH HOSPITAL   (United States)

^c Center for Advanced Research and Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; OPTIMIZATION; RANDOM PROCESSES;

HOPFIELD STYLE NETWORK; HYPERGRAPHS; INSTRUCTOR HIRING PROBLEM; MINIMUM SET COVER; NEURAL NETWORK ALGORITHM;

NEURAL NETWORKS;

EID: 0031148199     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0255(96)00214-9     Document Type: Article

References (10)

1. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, New York, 1979.
2. G. H. Goldbeer, J. Lipscomb, and M. Luby, On the computational complexity of finding stable state vectors in connectionist models (Hopfield nets), TR, Dept. Computer Science, University of Toronto, 1988.
3. T. Grossman, A neural computation approach to the set covering problem, submitted to Neural Information Processing Systems Conf., 1995.
4. T. Grossman and A. Wool, Computational experience with approximation algorithms for the set covering problem, unpublished manuscript, 1995.
5. J. J. Hopfield, Neural networks and physical systems with emergent collective computational abilities, Proc. Nat. Acad. Sci., 79 (1982).
6. A. Jagota, Optimization by reduction to maximum clique, in: Int. Conf. Neural Networks, New York, NY, Mar. 1993, pp. 1526-1531.
7. A. Jagota, Optimization by a Hopfield-style network, in: D. S. Levine and W. Elsberry (Eds.), Optimality in Artificial and Biological Networks Lawrence Erlbaum, Hillsdale, NJ, 1994.
8. R. Motwani, Lecture notes on approximation algorithms, TR, Dept. Computer Science, Stanford University, 1992. Available from author.
9. J. Ramanujam and P. Sadayappan, Optimization by neural networks, IEEE Int. Conf. Neural Networks, Vol. 2, New York, NY, 1988, pp. 325-332.
10. Y. Shrivastava, S. Dasgupta, and S. M. Reddy, Neural network solutions to a graph theoretic problem, in: Proc. IEEE Int. Symp. Circuits and Syst., New York, NY, IEEE, 1990, pp. 2528-2531.