Deterministic discrepancy minimization
type: Item
instance of: scholarly article
title: Deterministic discrepancy minimization
zbMATH Open document ID: 1308.90125
author: N. Bansal
author: Joel Spencer
published in: Algorithmica
publication date: 2015-03-23T00:00:00Z
Mathematics Subject Classification ID: 90C22
Mathematics Subject Classification ID: 05D05
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68W20
zbMATH DE Number: 6418583
zbMATH Keywords: discrepancy
zbMATH Keywords: derandomization
zbMATH Keywords: algorithms
MaRDI profile type: Publication
full work available at URL: s00453-012-9728-1
OpenAlex ID: W2144053122
cites work: The probabilistic method. With an appendix on the life and work of Paul Erdős.
cites work: Roth's estimate of the discrepancy of integer sequences is nearly sharp
cites work: Q4515159
cites work: Linear and hereditary discrepancy
cites work: Sequences, discrepancies and applications
cites work: Q4829005
cites work: Discrepancy after adding a single set
cites work: Discrepancy of set-systems and matrices
cites work: Derandomizing Approximation Algorithms Based on Semidefinite Programming
cites work: The determinant bound for discrepancy is almost tight
cites work: An \(L_p\) version of the Beck-Fiala conjecture
cites work: Geometric discrepancy. An illustrated guide
cites work: Probabilistic construction of deterministic algorithms: approximating packing integer programs
cites work: Algorithmic derandomization via complexity theory
cites work: Balancing games
cites work: Six Standard Deviations Suffice
DOI: 10.1007/S00453-012-9728-1
description: scientific article; zbMATH DE number 6418583