Matrix completion: approximating the minimum diameter
From MaRDI portal
Cites work
- (2+)-Sat is NP-hard
- Analysis of incomplete data and an intrinsic-dimension Helly theorem
- Approximation algorithms for Hamming clustering problems
- Clustering affine subspaces: hardness and algorithms
- Clustering lines in high-dimensional space, classification of incomplete data
- Clustering to minimize the maximum intercluster distance
- Clustering to minimize the sum of cluster diameters
- Consensus patterns (probably) has no EPTAS
- Consensus strings with small maximum distance and small distance sum
- Finding a cluster in incomplete data
- Finding consensus strings with small length difference between input and solution strings
- Fixed-parameter algorithms for CLOSEST STRING and related problems
- scientific article; zbMATH DE number 1256636 (Why is no real title available?)
- scientific article; zbMATH DE number 1263221 (Why is no real title available?)
- scientific article; zbMATH DE number 7788495 (Why is no real title available?)
- scientific article; zbMATH DE number 7799590 (Why is no real title available?)
- Multivariate algorithmics for NP-hard string problems
- On the closest string and substring problems
- On the kernelization complexity of string problems
- Parameterized Algorithms for Matrix Completion with Radius Constraints.
- Parameterized complexity analysis for the closest string with wildcards problem
- Polynomial and APX-hard cases of the individual haplotyping problem
- Statistical analysis with missing data
- Tight hardness results for consensus problems on circular strings and time series
This page was built for publication: Matrix completion: approximating the minimum diameter
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6953203)
