Rebecca Hoberg

Learn More
For bin packing, the input consists of n items with sizes s 1 ,. .. , s n ∈ [0, 1] which have to be assigned to a minimum number of bins of size 1. Recently, the second author gave an LP-based polynomial time algorithm that employed techniques from discrepancy theory to find a solution using at most OP T + O(logOP T · log logOP T) bins. In this paper, we(More)
Let p(n) denote the ordinary partition function. In 1966, Subbarao [18] conjectured that in every arithmetic progression r (mod t) there are infinitely many integers N (resp. M) ≡ r (mod t) for which p(N) is even (resp. odd). We prove Subbarao's conjecture for all moduli t of the form m · 2 s where m ∈ {1, 5, 7, 17}. To obtain this theorem we make use of(More)
  • 1