Parameterized Algorithms for Matrix Completion With Radius Constraints

Koana Tomohiro
Koana Tomohiro

CPM, 2020.

Cited by: 1|Views25
EI

Abstract:

Considering matrices with missing entries, we study NP-hard matrix completion problems where the resulting completed matrix shall have limited (local) radius. In the pure radius version, this means that the goal is to fill in the entries such that there exists a 'center string' which has Hamming distance to all matrix rows as small as p...More

Code:

Data:

Your rating :
0

 

Tags
Comments