Abstract
The Weighted Minimum Hitting Set Problem (WMHSP) and the standard Minimum Hitting Set Problem (MHSP), are combinatorial problems of great interest for many applications. Although, these problems lend themselves quite naturally to an evolutionary approach. To our knowledge, there are no significant results of evolutionary algorithms applied to either the WMHSP or the MHSP, except for the results contained in Cutello et al., (2002).
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
References
Cutello, V., Mastriani, E., and Pappalardo, F. An evolutionary algorithm for the T-constrained variation of the Minimum Hitting Set Problem. In Proceedings of 2002 IEEE Congress on Evolutionary Computation (CEC2002) Vol. 1, pp. 366–371.
Feige, U. A threshold of log n for approximating set cover. Journal of ACM 45 (1998), pp. 634–652.
Papadimitriou, C.H., and Steiglitz, K. Combinatorial Optimization. Prentice Hall (1982), p. 407.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cutello, V., Pappalardo, F. (2003). The Hitting Set Problem and Evolutionary Algorithmic Techniques with ad-hoc Viruses (HEAT-V). In: Cantú-Paz, E., et al. Genetic and Evolutionary Computation — GECCO 2003. GECCO 2003. Lecture Notes in Computer Science, vol 2724. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45110-2_29
Download citation
DOI: https://doi.org/10.1007/3-540-45110-2_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40603-7
Online ISBN: 978-3-540-45110-5
eBook Packages: Springer Book Archive