LIPIcs.IPEC.2021.32.pdf
- Filesize: 0.51 MB
- 3 pages
Document
PACE Solver Description: CluES - a Heuristic Solver for the Cluster Editing Problem
Author
Sylwester Swat 
-
Part of:
Volume:
16th International Symposium on Parameterized and Exact Computation (IPEC 2021)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Symposium on Parameterized and Exact Computation (IPEC) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2021-11-22
File
Document Identifiers
Author Details
Cite AsGet BibTex
Sylwester Swat. PACE Solver Description: CluES - a Heuristic Solver for the Cluster Editing Problem. In 16th International Symposium on Parameterized and Exact Computation (IPEC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 214, pp. 32:1-32:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
https://doi.org/10.4230/LIPIcs.IPEC.2021.32
https://doi.org/10.4230/LIPIcs.IPEC.2021.32
Abstract
This article briefly describes the most important algorithms and techniques used in the cluster editing heuristic solver called "CluES", submitted to the 6th Parameterized Algorithms and Computational Experiments Challenge (PACE 2021).
Subject Classification
ACM Subject Classification
- Mathematics of computing → Graph algorithms
Keywords
- Cluster editing
- heuristic solver
- graph algorithms
- PACE 2021
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads
References
-
Sebastian Böcker, Sebastian Briesemeister, and Gunnar Klau. Exact algorithms for cluster editing: Evaluation and experiments. Algorithmica, 60:316-334, January 2008.
-
Jianer Chen and Jie Meng. A 2k kernel for the cluster editing problem. Journal of Computer and System Sciences, 78(1):211-220, 2012. JCSS Knowledge Representation and Reasoning.
-
Jiong Guo. A more effective linear kernelization for cluster editing. Theor. Comput. Sci., 410:718-726, March 2009.