On the parameterized complexity of clustering problems for incomplete data
From MaRDI portal
Publication:2689366
DOI10.1016/j.jcss.2022.12.001OpenAlexW4313406961MaRDI QIDQ2689366
Stefan Szeider, Robert Ganian, Eduard Eiben, Sebastian Ordyniak, Iyad A. Kanj
Publication date: 10 March 2023
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.01465
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Parameterized complexity, tractability and kernelization (68Q27) Computational aspects of data analysis and big data (68T09)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fundamentals of parameterized complexity
- Guarantees and limits of preprocessing in constraint satisfaction and reasoning
- Parameterized complexity analysis for the closest string with wildcards problem
- On covering problems of codes
- A simple heuristic for the p-centre problem
- Parameterized complexity of constraint satisfaction problems
- Approximation algorithms for Hamming clustering problems
- Clustering to minimize the maximum intercluster distance
- Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete
- Fixed-parameter algorithms for CLOSEST STRING and related problems
- Clustering to minimize the sum of cluster diameters
- Parameterized low-rank binary matrix approximation
- Partition into triangles on bounded degree graphs
- Parametrized complexity theory.
- Exact matrix completion via convex optimization
- Geometric clustering
- Intersection Theorems for Systems of Sets
- Kernelization
- Approximation Schemes for Low-rank Binary Matrix Approximation Problems
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Combinatorial Pattern Matching
- Parameterized Algorithms
- Data Clustering: Theory, Algorithms, and Applications
- Parameterized Algorithms for Matrix Completion with Radius Constraints.
- Parameterized k-Clustering: Tractability Island
- Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems
This page was built for publication: On the parameterized complexity of clustering problems for incomplete data
