Fetching the paper…
Reading the bibliography…
Given three permutations on the integers 1 through n, consider the set system consisting of each interval in each of the three permutations.
An efficient approximation scheme for the one-dimensional bin-packing problem
Narendra Karmarkar and Richard M. Karp · 1982
Earlier work this paper cites.
Ten Lectures on the Probabilistic Method
Joel Spencer · 1987
Earlier work this paper cites.
On the discrepancy of 3 permutations
Géza Bohus · 1990
Earlier work this paper cites.
The discrepancy of permutation families, 2001
J. H. Spencer, A. Srinivasan, and P. Tetali · 2001
Cited alongside, same era.
Constructive algorithms for discrepancy minimization
Nikhil Bansal · 2010
Cited alongside, same era.
Geometric Discrepancy: An Illustrated Guide
J. Matousek · 2010
Later among the works it cites.
Bin packing via discrepancy of permutations
Friedrich Eisenbrand, Dömötör Pálvölgyi, and Thomas Rothvoß · 2011
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…