Finding a cluster in incomplete data
From MaRDI portal
Cites work
- A simple heuristic for the p-centre problem
- Approximation algorithms for Hamming clustering problems
- Closest Substring Problems with Small Distances
- Clustering to minimize the maximum intercluster distance
- Clustering to minimize the sum of cluster diameters
- Consensus strings with small maximum distance and small distance sum
- Fixed-parameter algorithms for CLOSEST STRING and related problems
- Fundamentals of parameterized complexity
- Geometric clustering, fixed-parameter tractability and lower bounds with respect to the dimension
- scientific article; zbMATH DE number 1305511 (Why is no real title available?)
- Integer Programming with a Fixed Number of Variables
- On covering problems of codes
- On the closest string and substring problems
- Parameterized algorithms
- Parameterized Algorithms for Matrix Completion with Radius Constraints.
- Parameterized complexity analysis for the closest string with wildcards problem
- Parameterized complexity and kernelizability of max ones and exact ones problems
- Parameterized complexity of constraint satisfaction problems
Cited in
(3)
This page was built for publication: Finding a cluster in incomplete data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6969635)
