Finding a Cluster in Incomplete Data

Eiben, E, Ganian, R, Kanj, I et al. (2 more authors) (2022) Finding a Cluster in Incomplete Data. In: Chechik, S, Navarro, G, Rotenberg, E and Herman, G, (eds.) Proceedings of 30th Annual European Symposium on Algorithms (ESA 2022). 30th Annual European Symposium on Algorithms (ESA 2022), 05-07 Sep 2022, Postdam, Germany. Leibniz International Proceedings in Informatics (LIPIcs), 244 . Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik , 47:1-47:14. ISBN 978-3-95977-247-1

Abstract

Metadata

Authors/Creators:
Copyright, Publisher and Additional Information: © Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, and Stefan Szeider. This is an open access conference paper under the terms of the Creative Commons Attribution License (CC-BY 4.0), which permits unrestricted use, distribution and reproduction in any medium, provided the original work is properly cited.
Keywords: Parameterized complexity, incomplete data, clustering
Dates:
  • Accepted: 23 June 2022
  • Published: 1 September 2022
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds)
Funding Information:
FunderGrant number
EPSRC (Engineering and Physical Sciences Research Council)EP/V00252X/1
Depositing User: Symplectic Publications
Date Deposited: 21 Jul 2022 13:43
Last Modified: 07 Aug 2023 09:28
Status: Published
Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
Series Name: Leibniz International Proceedings in Informatics (LIPIcs)
Identification Number: https://doi.org/10.4230/LIPIcs.ESA.2022.47

Export

Statistics