# Complexity of Combinatorial Matrix Completion With Diameter Constraints

@article{Koana2020ComplexityOC, title={Complexity of Combinatorial Matrix Completion With Diameter Constraints}, author={Tomohiro Koana and Vincent Froese and Rolf Niedermeier}, journal={ArXiv}, year={2020}, volume={abs/2002.05068} }

We thoroughly study a novel and still basic combinatorial matrix completion problem: Given a binary incomplete matrix, fill in the missing entries so that the resulting matrix has a specified maximum diameter (that is, upper-bounding the maximum Hamming distance between any two rows of the completed matrix) as well as a specified minimum Hamming distance between any two of the matrix rows. This scenario is closely related to consensus string problems as well as to recently studied clustering… CONTINUE READING

Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv