Approximation of the Consecutive Ones Matrix Augmentation Problem
Marinus Veldhorst · SIAM Journal on Computing · 1985
In this publication we will prove a number of negative results concerning the approximation of the NP-complete CONSECUTIVE ONES MATRIX AUGMENTATION problem. We will characterize a large class of simple algorithms that do not find a near optimum augmentation of their input matrices. We will show that there are matrices for which these algorithms find augmentations that are even far from optimal. These results are important for the analysis of a sparse matrix storage scheme.