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žené v:

Podrobná bibliografia
Vydané v:	Journal of computer and system sciences Ročník 132; s. 45 - 67
Hlavní autori:	Koana, Tomohiro, Froese, Vincent, Niedermeier, Rolf
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Inc 01.03.2023
Predmet:	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 prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!