Add to ORKGWe show that any real valued matrix A can be rounded to an integer one B such that the error in all 2 × 2 (geometric) submatrices is less than 1.5, that is, we have |aij - bij| < 1 and for all i,j
A general analysis of the condit4on of the linear least squares problem is given. The influence of r...
We consider the problem of approximating a given matrix by an integer one such that in all geometric...
The problem considered in this paper is that of consistently rounding off the elements of a matrix a...
We show that any real valued matrix A can be rounded to an integer one B such that the error in all...
We show several ways to round a real matrix to an integer one in such a way that the rounding errors...
We show that any real matrix can be rounded to an integer matrix in such a way that the rounding err...
We study the problem of rounding a real-valued matrix into an integer-valued matrix to minimize an L...
Abstract. Rounding a real-valued matrix to an integer one such that the rounding errors in all rows ...
AbstractThe linear discrepancy problem is to round a given [0,1]-vector x to a binary vector y such ...
A problem arising in integer linear programming is transforming a solution of a linear system to an ...
Motivated by an application from image processing (Asano et al., SODA 2002), we investigate the prob...
A problem arising in integer linear programming is transforming a solution of a linear system to an...
Rounding a real-valued matrix to an integer one such that the rounding errors in all rows and column...
When factorizing binary matrices, we often have to make a choice between using expensive combinatori...
AbstractWe consider the problem of approximating a given matrix by an integer one such that in all g...
A general analysis of the condit4on of the linear least squares problem is given. The influence of r...
We consider the problem of approximating a given matrix by an integer one such that in all geometric...
The problem considered in this paper is that of consistently rounding off the elements of a matrix a...
We show that any real valued matrix A can be rounded to an integer one B such that the error in all...
We show several ways to round a real matrix to an integer one in such a way that the rounding errors...
We show that any real matrix can be rounded to an integer matrix in such a way that the rounding err...
We study the problem of rounding a real-valued matrix into an integer-valued matrix to minimize an L...
Abstract. Rounding a real-valued matrix to an integer one such that the rounding errors in all rows ...
AbstractThe linear discrepancy problem is to round a given [0,1]-vector x to a binary vector y such ...
A problem arising in integer linear programming is transforming a solution of a linear system to an ...
Motivated by an application from image processing (Asano et al., SODA 2002), we investigate the prob...
A problem arising in integer linear programming is transforming a solution of a linear system to an...
Rounding a real-valued matrix to an integer one such that the rounding errors in all rows and column...
When factorizing binary matrices, we often have to make a choice between using expensive combinatori...
AbstractWe consider the problem of approximating a given matrix by an integer one such that in all g...
A general analysis of the condit4on of the linear least squares problem is given. The influence of r...
We consider the problem of approximating a given matrix by an integer one such that in all geometric...
The problem considered in this paper is that of consistently rounding off the elements of a matrix a...