On the parameterized complexity of clustering problems for incomplete data
-
Published:2023-06
Issue:
Volume:134
Page:1-19
-
ISSN:0022-0000
-
Container-title:Journal of Computer and System Sciences
-
language:en
-
Short-container-title:Journal of Computer and System Sciences
Author:
Eiben Eduard,Ganian Robert,Kanj Iyad,Ordyniak Sebastian,Szeider Stefan
Funder
DePaul University
University Research Council, DePaul University
Engineering and Physical Sciences Research Council
Vienna Science and Technology Fund
Austrian Science Fund
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science,General Computer Science
Reference47 articles.
1. Data Clustering: Algorithms and Applications;Aggarwal,2013
2. k-subspaces with missing data;Balzano,2012
3. Closest string with outliers;Boucher;BMC Bioinform.,2011
4. Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension;Cabello;ACM Trans. Algorithms,2011
5. Matrix completion with noise;Candès;Proc. IEEE,2010