Time complexity analysis of RLS and (1 + 1) EA for the edge coloring problem

Bossek, J. and Sudholt, D. orcid.org/0000-0001-6020-1646 (2019) Time complexity analysis of RLS and (1 + 1) EA for the edge coloring problem. In: FOGA '19- Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms. 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 27-29 Aug 2019, Potsdam, Germany. ACM Digital Library . ISBN 9781450362542

Abstract

Metadata

Authors/Creators:
Copyright, Publisher and Additional Information: © 2019 The Authors. This is an author-produced version of a paper subsequently published in Proceedings of the 15th ACM/SIGEVO Conference. Uploaded in accordance with the publisher's self-archiving policy.
Keywords: Edge coloring problem; runtime analysis
Dates:
  • Published (online): 27 August 2019
  • Published: 27 August 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: 17 Oct 2019 14:21
Last Modified: 18 Oct 2019 02:02
Published Version: https://dl.acm.org/authorize?N680205
Status: Published
Publisher: ACM Digital Library
Refereed: Yes
Identification Number: https://doi.org/10.1145/3299904.3340311

Share / Export

Statistics