Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

Constructive Algorithms for Discrepancy Minimization

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Bansal, N. ; IBM T. J. Watson Res. Center, Yorktown Heights, NY, USA

Given a set system (V, S), V = {1,..., n} and S = {S1,...,Sm}, the minimum discrepancy problem is to find a 2-coloring X : V → {-1,+1}, such that each set is colored as evenly as possible, i.e. find X to minimize maxj∈|m] Σi∈sj X(i)|· In this paper we give the first polynomial time algorithms for discrepancy minimization that achieve bounds similar to those known existentially using the so-called Entropy Method. We also give a first approximation-like result for discrepancy. Specifically we give efficient randomized algorithms to: 1) Construct an O(n1/2) discrepancy coloring for general sets systems when m = O(n), matching the celebrated result of Spencer [17] up to O(1) factors. More generally, for m ≥ n, we obtain a discrepancy of O(n1/2 log(2m/n)). 2) Construct a coloring with discrepancy O(t1/2 log n), if each element lies in at most t sets. This matches the (nonconstructive) result of Srinivasan [19]. 3) Construct a coloring with discrepancy O(λlog(ram)), where λ is the hereditary discrepancy of the set system. The main idea in our algorithms is to produce a coloring over time by letting the color of the elements perform a random walk (with tiny increments) starting from 0 until they reach ±1. At each step the random hops for various elements are correlated by a solution to a semidefinite program, where this program is determined by the current state and the entropy method.

Published in:

Foundations of Computer Science (FOCS), 2010 51st Annual IEEE Symposium on

Date of Conference:

23-26 Oct. 2010