Showing 1 - 10 of 10
We study a problem of minimising the total number of zeros in the gaps between blocks of consecutive ones in the columns of a binary matrix by permuting its rows. The problem is referred to as the Consecutive Ones Matrix Augmentation Problem, and is known to be NP-hard. An analysis of the...
Persistent link: https://www.econbiz.de/10010664718
Persistent link: https://www.econbiz.de/10012125310
Persistent link: https://www.econbiz.de/10015100979
Persistent link: https://www.econbiz.de/10010370682
Persistent link: https://www.econbiz.de/10003855924
Persistent link: https://www.econbiz.de/10011338656
Persistent link: https://www.econbiz.de/10011801634
Persistent link: https://www.econbiz.de/10012581804
Persistent link: https://www.econbiz.de/10012649723
Persistent link: https://www.econbiz.de/10012183687