Matrix approximation and Tusnády's problem

European Journal of Combinatorics

Volumn 28, Issue 3, 2007, Pages 990-995

  Doerr, Benjamin ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33751421528     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejc.2005.09.006     Document Type: Article

References (24)

1. p-discrepancy measure and its application to digital halftoning. SIAM J. Comput. 32 (2003) 1423-1435
2. Asano T. Digital halftoning: Algorithm engineering challenges. IEICE Trans. Inf. Syst. E86-D (2003) 159-178
3. Baranyai Zs. On the factorization of the complete uniform hypergraph. Infinite and Finite Sets (Colloq., Keszthely, 1973; dedicated to P. Erdo{double acute}s on his 60th birthday), Vol. I. Colloq. Math. Soc. Jánōs Bolyai vol. 10 (1975), North-Holland, Amsterdam 91-108
4. Brauner N., and Crama Y. The maximum deviation just-in-time scheduling problem. Discrete Appl. Math. 134 (2004) 25-50
5. Beck J. Balanced two-colorings of finite sets in the square. I. Combinatorica 1 (1981) 327-335
6. Beck J. Roth's estimate of the discrepancy of integer sequences is nearly sharp. Combinatorica 1 (1981) 319-325
7. Beck J. Balanced two-colorings of finite sets in the cube. Discrete Math. 73 (1989) 13-25
8. Bohus G. On the discrepancy of 3 permutations. Random Structures Algorithms 1 (1990) 215-220
9. Causey B.D., Cox L.H., and Ernst L.R. Applications of transportation theory to statistical problems. J. Amer. Statist. Assoc. 80 (1985) 903-909
10. Doerr B., Friedrich T., Klein C., and Osbild R. Rounding of sequences and matrices, with applications. In: Erlebach T., and Persiano G. (Eds). WAOA 2005. Lecture Notes in Computer Science vol. 3879 (2006), Springer-Verlag, Berlin, Heidelberg 96-109
11. Doerr B. Linear and hereditary discrepancy. Combin. Probab. Comput. 9 (2000) 349-354
12. Doerr B. Global roundings of sequences. Inform. Process. Lett. 92 (2004) 113-116
13. Doerr B. Nonindependent randomized rounding and an application to digital halftoning. SIAM J. Comput. 34 (2004) 299-317
14. Hell P., Kirkpatrick D., and Li B. Rounding in symmetric matrices and undirected graphs. Discrete Appl. Math. 70 (1996) 1-21
15. Karp R.M., Leighton F.T., Rivest R.L., Thompson C.D., Vazirani U.V., and Vazirani V.V. Global wire routing in two-dimensional arrays. Algorithmica 2 (1987) 113-129
16. Komlós J., Major P., and Tusnády G. Weak convergence and embedding. Limit Theorems of Probability Theory (Colloq., Keszthely, 1974). Colloq. Math. Soc. János Bolyai vol. 11 (1975), North-Holland, Amsterdam 149-165
17. Lovász L., Spencer J., and Vesztergombi K. Discrepancies of set-systems and matrices. European J. Combin. 7 (1986) 151-160
18. Matoušek J. Geometric Discrepancy (1999), Springer-Verlag, Berlin
19. Niederreiter H. Random Number Generation and Quasi-Monte Carlo Methods. CBMS-NSF Regional Conference Series in Applied Mathematics vol. 63 (1992), Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA
20. Raghavan P. Probabilistic construction of deterministic algorithms: Approximating packing integer programs. J. Comput. System Sci. 37 (1988) 130-143
21. Schmidt W.M. On irregularities of distribution VII. Acta Arith. 21 (1972) 45-50
22. Srinivasan A. Improving the discrepancy bound for sparse matrices: Better approximations for sparse lattice approximation problems. Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA (1997), ACM, New York 692-701
23. Sadakane K., Takki-Chebihi N., and Tokuyama T. Combinatorics and algorithms on low-discrepancy roundings of a real sequence. ICALP 2001. Lecture Notes in Computer Science vol. 2076 (2001), Springer-Verlag, Berlin, Heidelberg 166-177
24. Steiner G., and Yeomans S. Level schedules for mixed-model, just-in-time processes. Manage. Sci. 39 (1993) 728-735