Hostname: page-component-7dd5485656-j7khd Total loading time: 0 Render date: 2025-10-30T12:36:49.345Z Has data issue: false hasContentIssue false
  • English
  • Français

Linear and Hereditary Discrepancy

Published online by Cambridge University Press:  06 November 2000

BENJAMIN DOERR
BENJAMIN DOERR
Affiliation:
Mathematisches Seminar, Christian-Albrechts-Universität zu Kiel, Ludewig-Meyn-Str. 4, 24098 Kiel, Germany (e-mail: bed@numerik.uni-kiel.de)
Get access Rights & Permissions [Opens in a new window]

Abstract

Let A be an m × n matrix and q := [lfloor]log2(m)[rfloor]+1. In this article we improve the well-known bound lindisc(A) [les ] 2 herdisc(A) and show that

formula here

As with the previous proofs relating to this problem, ours is constructive. We will give an on-line algorithm and analyse it using game theory.

Information

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 9 , Issue 4 , July 2000 , pp. 349 - 354
Copyright
2000 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable