The PACE 2021 Parameterized Algorithms and Computational Experiments Challenge: Cluster Editing

Λεπτομέρειες βιβλιογραφικής εγγραφής
Τίτλος:	The PACE 2021 Parameterized Algorithms and Computational Experiments Challenge: Cluster Editing
Συγγραφείς:	Kellerhals, Leon, Koana, Tomohiro, Zschoche, Philipp
Στοιχεία εκδότη:	LIPIcs - Leibniz International Proceedings in Informatics. 16th International Symposium on Parameterized and Exact Computation (IPEC 2021) 2021
Τύπος εγγράφου:	Mixed materials
Περίληψη:	The Parameterized Algorithms and Computational Experiments challenge (PACE) 2021 was devoted to engineer algorithms solving the NP-hard Cluster Editing problem, also known as Correlation Clustering: Given an undirected graph the task is to compute a minimum number of edges to insert or remove in a way that the resulting graph is a cluster graph, that is, a graph in which each connected component is a clique. Altogether 67 participants from 21 teams, 11 countries, and 3 continents submitted their implementations to the competition. In this report, we describe the setup of the challenge, the selection of benchmark instances, and the ranking of the participating teams. We also briefly discuss the approaches used in the submitted solvers.
Όροι ευρετηρίου:	Correlation Clustering, Cluster Editing, Algorithm Engineering, FPT, Kernelization, Heuristics, Data processing Computer science, InProceedings, publishedVersion
DOI:	10.4230.LIPIcs.IPEC.2021.26
Διαθεσιμότητα:	Open access content. Open access content https://creativecommons.org/licenses/by/4.0
Σημείωση:	application/pdf English
Other Numbers:	DEDAG oai:drops-oai.dagstuhl.de:15409 doi:10.4230/LIPIcs.IPEC.2021.26 urn:nbn:de:0030-drops-154096 https://drops.dagstuhl.de/opus/volltexte/2021/15409/ 1291877291
Πηγή συνεισφοράς:	SCHLOSS DAGSTUHL LEIBNIZ ZENTRUM GMBH From OAIster®, provided by the OCLC Cooperative.
Αριθμός Καταχώρησης:	edsoai.on1291877291
Βάση Δεδομένων:	OAIster

Περιγραφή
DOI:	10.4230.LIPIcs.IPEC.2021.26