Complexity of Combinatorial Matrix Completion With Diameter Constraints

02/12/2020
by   Tomohiro Koana, et al.
0

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 problems on incomplete data. We obtain an almost complete complexity dichotomy between polynomial-time solvable and NP-hard cases in terms of the minimum distance lower bound and the number of missing entries per row of the incomplete matrix. Further, we develop polynomial-time algorithms for maximum diameter three, which are based on Deza's theorem from extremal set theory. On the negative side we prove NP-hardness for diameter at least four. For the parameter number of missing entries per row, we show polynomial-time solvability when there is only one missing entry and NP-hardness when there can be at least two missing entries. In general, our algorithms heavily rely on Deza's theorem and the correspondingly identified sunflower structures pave the way towards solutions based on computing graph factors and solving 2-SAT instances.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/03/2020

Parameterized Algorithms for Matrix Completion With Radius Constraints

Considering matrices with missing entries, we study NP-hard matrix compl...
research
04/29/2018

A QPTAS for Gapless MEC

We consider the problem Minimum Error Correction (MEC). A MEC instance i...
research
08/12/2016

Chi-squared Amplification: Identifying Hidden Hubs

We consider the following general hidden hubs model: an n × n random mat...
research
01/08/2021

On the Recognition of Strong-Robinsonian Incomplete Matrices

A matrix is incomplete when some of its entries are missing. A Robinson ...
research
04/10/2018

Parameterized Algorithms for the Matrix Completion Problem

We consider two matrix completion problems, in which we are given a matr...
research
09/17/2020

Algorithms and Complexity for Variants of Covariates Fine Balance

We study here several variants of the covariates fine balance problem wh...
research
09/14/2022

The Complexity Classes of Hamming Distance Recoverable Robust Problems

In the well-known complexity class NP are combinatorial problems, whose ...

Please sign up or login with your details

Forgot password? Click here to reset