Skip to main content
SpringerLink
Log in

Evolutionary algorithms for vertex cover

  • Conference paper
  • First Online:
Evolutionary Programming VII (EP 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1447))

Included in the following conference series:

Abstract

This paper reports work investigating various evolutionary approaches to vertex cover (VC), a well-known NP-Hard optimization problem. Central to each of the algorithms is a novel encoding scheme for VC and related problems that treats each chromosome as a binary decision diagram. As a result, the encoding allows only a (guaranteed optimal) subset of feasible solutions. The encoding also incorporates features of a powerful traditional heuristic for VC that allow initial evolutionary algorithm (EA) populations to be seeded in known promising regions of the search space. The resulting EAs have displayed exceptionally strong empirical performance on various vertex cover, independent set, and maximum clique problem classes.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aggarwal, C. C., Orlin, J. B., and Tai, R. P. “Optimized Crossover for the Independent Set Problem,” Operations Research, 45(2):226–234, March–April 1997.

    Google Scholar 

  2. Bäck, T. and Khuri, S. “An Evolutionary Heuristic for the Maximum Independent Set Problem,” in Proc. First IEEE Conference on Evolutionary Computation, IEEE Press, pp. 531–535, 1994.

    Google Scholar 

  3. Bar-Yehuda, R. and Even, S. “A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem,” Annals of Discrete Mathematics, 25:27–45, 1985.

    Google Scholar 

  4. Brglez, F., Bryan, D. and Kozminski, K. “Combinational Profiles of Sequential Benchmark Circuits,” in Proc. Intl. Symp. on Circuits and Systems, pp. 1929–1934, 1989.

    Google Scholar 

  5. Bui, T. N. and Eppley, P. H. “A Hybrid Genetic Algorithm for the Maximum Clique Problem,” in Proc. of the 6th ICGA, Morgan Kaufmann, pp. 478–484, 1995.

    Google Scholar 

  6. Evans, I. K. “Embracing Premature Convergence: The Hypergamous Parallel Genetic Algorithm,” to appear in Proc. of the 5th IEEE Intl. Conf. on Evolutionary Computation.

    Google Scholar 

  7. Evans, I. K. “Reemphasizing Recombination in Evolutionary Search: Heuristics for Vertex Cover,” Ph.D. Thesis, University of Iowa, 1997.

    Google Scholar 

  8. Feo, T. A., Resende, M. and Smith, S. H. “A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set,” Operations Research, 42(5):860–878, September–October 1994.

    Google Scholar 

  9. Garey, M. R. and Johnson, D. S. Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman & Co., 1979.

    Google Scholar 

  10. Halldórsson, M. M. and Radhakrishnan, J. “Greed is Good: Approximating Independent Sets in Sparse and Bounded-degree Graphs,” Proc. 26 th ACM Symposium on Theory of Computing, pp. 439–448, 1994.

    Google Scholar 

  11. Hochbaum, D. S., ed. Approximation Algorithms for NP-Hard Problems, PWS Publishing Company, 1997.

    Google Scholar 

  12. Kommu, V. “Enhanced Genetic Algorithms in Constrained Search Spaces with Emphasis in Parallel Environments,” Ph.D. Thesis, The University of Iowa, 1993.

    Google Scholar 

  13. Motwani, R. “Lecture Notes on Approximation Algorithms — Volume I,” Technical Report, Department of Computer Science, Stanford University, 1992.

    Google Scholar 

  14. Pramanick I. and Kuhl, J. G. “A Practical Method for Computing Vertex Covers for Large Graphs,” in Proc. Intl. Symposium on Circuits and Systems pp. 1859–1862, 1992.

    Google Scholar 

  15. Pramanick I. and Kuhl, J. G. “An Inherently Parallel Method for Heuristic Problem-Solving: Part II-Example Applications,” IEEE Transactions on Parallel and Distributed Systems, 6(10):1016–1028, 1995.

    Google Scholar 

  16. Shrivastava, Y., Dasgupta, S. and Reddy, S. M. “Guaranteed Convergence in a Class of Hopfield Networks,” IEEE Transactions on Neural Networks, 3(6):951–960, 1992.

    Google Scholar 

  17. DIMACS Challenge Problems for Maximum Clique, available via anonymous FTP at dimacs.rutgers.edu.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, University of Iowa, 52242, Iowa City, IA

    Isaac K. Evans

Authors
  1. Isaac K. Evans
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

V. W. Porto N. Saravanan D. Waagen A. E. Eiben

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Evans, I.K. (1998). Evolutionary algorithms for vertex cover. In: Porto, V.W., Saravanan, N., Waagen, D., Eiben, A.E. (eds) Evolutionary Programming VII. EP 1998. Lecture Notes in Computer Science, vol 1447. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0040790

Download citation

  • DOI: https://doi.org/10.1007/BFb0040790

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64891-8

  • Online ISBN: 978-3-540-68515-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation