Complexity of Combinatorial Matrix Completion With Diameter Constraints

Koana Tomohiro
Koana Tomohiro
Cited by: 0|Views20

Abstract:

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 minimu...More

Code:

Data:

Full Text
Bibtex
Your rating :
0

 

Tags
Comments