Discrepancy of set-systems and matrices
European Journal of Combinatorics
Probabilistic construction of deterministic algorithms: approximating packing integer programs
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
Balanced two-colorings of finite sets in the cube
Discrete Mathematics - Proceedings of the Oberwolfach Meeting "Kombinatorik," January 19-25, 1986
Level schedules for mixed-model, Just-in-Time processes
Management Science
Rounding in symmetric matrices and undirected graphs
Discrete Applied Mathematics
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Matrix Rounding under the Lp-Discrepancy Measure and Its Application to Digital Halftoning
SIAM Journal on Computing
The maximum deviation just-in-time scheduling problem
Discrete Applied Mathematics
Linear and Hereditary Discrepancy
Combinatorics, Probability and Computing
Nonindependent Randomized Rounding and an Application to Digital Halftoning
SIAM Journal on Computing
Information Processing Letters
Rounding of sequences and matrices, with applications
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
| Hi-index | 0.01 |
We consider the problem of approximating a given matrix by an integer one such that in all geometric submatrices the sum of the entries does not change by much. We show that for all integers m,n=2 and real matrices A@?R^m^x^n there is an integer matrix B@?Z^m^x^n such that |@?i@?I@?j@?J(a"i"j-b"i"j)|