Runtime analysis of randomized search heuristics for dynamic graph coloring

Bossek, J., Neumann, F., Peng, P. orcid.org/0000-0003-2700-5699 et al. (1 more author) (2019) Runtime analysis of randomized search heuristics for dynamic graph coloring. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 19). Genetic and Evolutionary Computation Conference (GECCO '19), 13-17 Jul 2019, Prague, Czech Republic. ACM , pp. 1443-1451. ISBN 9781450361118

Abstract

Metadata

Authors/Creators:
Copyright, Publisher and Additional Information: © 2019 ACM. [https://dl.acm.org/] This is an author-produced version of a paper accepted for publication in the Proceedings of GECCO 2019. Uploaded in accordance with the publisher's self-archiving policy.
Keywords: Evolutionary algorithms; dynamic optimization; running time analysis; theory
Dates:
  • Accepted: 21 March 2019
  • Published (online): 13 July 2019
  • Published: 13 July 2019
Institution: The University of Sheffield
Academic Units: The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield)
Depositing User: Symplectic Sheffield
Date Deposited: 01 May 2019 11:28
Last Modified: 09 Oct 2019 13:47
Status: Published
Publisher: ACM
Refereed: Yes
Identification Number: https://doi.org/10.1145/3321707.3321792

Share / Export

Statistics