The complexity of binary matrix completion under diameter constraints

We thoroughly study a novel but basic combinatorial matrix completion problem: Given a binary incomplete matrix, fill in the missing entries so that every pair of rows in the resulting matrix has a Hamming distance within a specified range. We obtain an almost complete picture of the complexity land...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of computer and system sciences Ročník 132; s. 45 - 67
Hlavní autoři: Koana, Tomohiro, Froese, Vincent, Niedermeier, Rolf
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Inc 01.03.2023
Témata:
2-SAT
Combinatorial algorithms
Complexity dichotomy
Consensus problems
Graph factors
Hamming distance
NP-hard problems
Stringology
Sunflowers
Stringology
Complexity dichotomy
Combinatorial algorithms
Hamming distance
NP-hard problems
Consensus problems
Graph factors
2-SAT
Sunflowers
ISSN:0022-0000, 1090-2724
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We thoroughly study a novel but basic combinatorial matrix completion problem: Given a binary incomplete matrix, fill in the missing entries so that every pair of rows in the resulting matrix has a Hamming distance within a specified range. We obtain an almost complete picture of the complexity landscape regarding the distance constraints and the maximum number of missing entries in any row. We develop polynomial-time algorithms for maximum diameter three based on Deza's theorem (1973) [11] from extremal set theory. We also prove NP-hardness for diameter at least four. For the number of missing entries per row, we show polynomial-time solvability when there is only one and NP-hardness when there can be at least two. In many of our algorithms, we heavily rely on Deza's theorem to identify sunflower structures. This paves the way towards polynomial-time algorithms which are based on finding graph factors and solving 2-SAT instances.
ISSN:0022-0000
1090-2724
DOI:10.1016/j.jcss.2022.10.001