Linear and Hereditary Discrepancy

Authors:
Benjamin Doerr
Affiliations:
Mathematisches Seminar, Christian-Albrechts-Universität zu Kiel, Ludewig-Meyn-Str. 4, 24098 Kiel, Germany (e-mail: bed@numerik.uni-kiel.de)
Venue:
Combinatorics, Probability and Computing
Year:
2000

Citing 2
Cited 5

Discrepancy of set-systems and matrices

European Journal of Combinatorics
Discrepancy theory

Handbook of combinatorics (vol. 2)

Typical Rounding Problems

APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Multicolour Discrepancies

Combinatorics, Probability and Computing
Typical rounding problems

Theoretical Computer Science
Matrix approximation and Tusnády's problem

European Journal of Combinatorics
Unbiased matrix rounding

SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let A be an m × n matrix and q := ⌊log2(m)⌋+1. In this article we improve the well-known bound lindisc(A) ≤ 2 herdisc(A) and show thatformula hereAs with the previous proofs relating to this problem, ours is constructive. We will give an on-line algorithm and analyse it using game theory.