Binary matrix completion under diameter constraints
From MaRDI portal
Cites work
- A new algorithm for optimal 2-constraint satisfaction and its implications
- Approximation algorithms for Hamming clustering problems
- Consensus strings with small maximum distance and small distance sum
- Exploiting hidden structure in selecting dimensions that distinguish vectors
- Extremal combinatorics. With applications in computer science
- Finding consensus strings with small length difference between input and solution strings
- Fixed-parameter algorithms for CLOSEST STRING and related problems
- Hard tiling problems with simple tiles
- scientific article; zbMATH DE number 4158856 (Why is no real title available?)
- scientific article; zbMATH DE number 3414305 (Why is no real title available?)
- Multivariate algorithmics for NP-hard string problems
- Multivariate fine-grained complexity of longest common subsequence
- Parameterized Algorithms for Matrix Completion with Radius Constraints.
- Parameterized complexity analysis for the closest string with wildcards problem
- Parametrized complexity theory.
- Polynomial and APX-hard cases of the individual haplotyping problem
- Tight hardness results for consensus problems on circular strings and time series
- Une propriété extremale des plans projectifs finis dans une classe de codes équidistants
This page was built for publication: Binary matrix completion under diameter constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7231571)
