Matrix approximation and Tusnády's problem
From MaRDI portal
Publication:872057
DOI10.1016/j.ejc.2005.09.006zbMath1128.15015OpenAlexW2061828232MaRDI QIDQ872057
Publication date: 27 March 2007
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2005.09.006
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Miscellaneous inequalities involving matrices (15A45) Matrices of integers (15B36)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Global roundings of sequences
- Discrepancy of set-systems and matrices
- Global wire routing in two-dimensional arrays
- Probabilistic construction of deterministic algorithms: approximating packing integer programs
- Balanced two-colorings of finite sets in the cube
- Balanced two-colorings of finite sets in the square. I
- Roth's estimate of the discrepancy of integer sequences is nearly sharp
- The maximum deviation just-in-time scheduling problem.
- Rounding in symmetric matrices and undirected graphs
- Linear and Hereditary Discrepancy
- On the discrepancy of 3 permutations
- Level Schedules for Mixed-Model, Just-in-Time Processes
- Matrix Rounding under the Lp-Discrepancy Measure and Its Application to Digital Halftoning
- Nonindependent Randomized Rounding and an Application to Digital Halftoning
- Irregularities of distribution, VII
- Approximation and Online Algorithms
- Geometric discrepancy. An illustrated guide
