skip to main content
10.1145/2598394.2605351acmconferencesArticle/Chapter ViewAbstractPublication PagesgeccoConference Proceedingsconference-collections
tutorial

Parameterized complexity analysis of evolutionary algorithms

Published:12 July 2014Publication History
First page image

References

  1. Karl Bringmann and Tobias Friedrich. Parameterized average-case complexity of the hypervolume indicator. In Proceedings of the ACM Genetic and Evolutionary Computation Conference (GECCO), pages 575-582. ACM Press, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Dogan Corus, Per Kristian Lehre, and Frank Neumann. The generalized minimum spanning tree problem: a parameterized complexity analysis of bi-level optimisation. In Christian Blum and Enrique Alba, editors, GECCO, pages 519-526. ACM, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Stefan Kratsch, Per Kristian Lehre, Frank Neumann, and Pietro Oliveto. Fixed parameter evolutionary algorithms and maximum leaf spanning trees: A matter of mutation. In Robert Schaefer, Carlos Cotta, Joanna Kolodziej, and Günter Rudolph, editors, Parallel Problem Solving from Nature - PPSN XI, volume 6238 of Lecture Notes in Computer Science, pages 204-213. Springer Berlin / Heidelberg, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Stefan Kratsch and Frank Neumann. Fixed-parameter evolutionary algorithms and the vertex cover problem. Algorithmica, 65(4):754-771, 2013.Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Samadhi Nallaperuma, Andrew M. Sutton, and Frank Neumann. Fixed-parameter evolutionary algorithms for the Euclidean traveling salesperson problem. In Evolutionary Computation (CEC), 2013 IEEE Congress on, pages 2037-2044, 2013.Google ScholarGoogle ScholarCross RefCross Ref
  6. Frank Neumann and Carsten Witt. Bioinspired Computation in Combinatorial Optimization - Algorithms and Their Computational Complexity. Springer, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Andrew M. Sutton, Jareth Day, and Frank Neumann. A parameterized runtime analysis of evolutionary algorithms for MAX-2-SAT. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2012), 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Andrew M. Sutton and Frank Neumann. A parameterized runtime analysis of simple evolutionary algorithms for makespan scheduling. In Carlos A. Coello Coello, Vincenzo Cutello, Kalyanmoy Deb, Stephanie Forrest, Giuseppe Nicosia, and Mario Pavone, editors, Parallel Problem Solving from Nature - PPSN XII, volume 7491 of Lecture Notes in Computer Science, pages 52-61. Springer Berlin Heidelberg, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Andrew M. Sutton, Frank Neumann, and Samadhi Nallaperuma. Parameterized runtime analyses of evolutionary algorithms for the planar Euclidean traveling salesperson problem. Evolutionary Computation, (in press), 2014.Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Parameterized complexity analysis of evolutionary algorithms

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      GECCO Comp '14: Proceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary Computation
      July 2014
      1524 pages
      ISBN:9781450328814
      DOI:10.1145/2598394

      Copyright © 2014 Owner/Author

      Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 12 July 2014

      Check for updates

      Qualifiers

      • tutorial

      Acceptance Rates

      GECCO Comp '14 Paper Acceptance Rate180of544submissions,33%Overall Acceptance Rate1,669of4,410submissions,38%

      Upcoming Conference

      GECCO '24
      Genetic and Evolutionary Computation Conference
      July 14 - 18, 2024
      Melbourne , VIC , Australia
    • Article Metrics

      • Downloads (Last 12 months)0
      • Downloads (Last 6 weeks)0

      Other Metrics

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader