Approximation-Friendly Discrepancy Rounding

  • Nikhil Bansal
  • Viswanath NagarajanEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9682)


Rounding linear programs using techniques from discrepancy is a recent approach that has been very successful in certain settings. However this method also has some limitations when compared to approaches such as randomized and iterative rounding. We provide an extension of the discrepancy-based rounding algorithm due to Lovett-Meka that (i) combines the advantages of both randomized and iterated rounding, (ii) makes it applicable to settings with more general combinatorial structure such as matroids. As applications of this approach, we obtain new results for various classical problems such as linear system rounding, degree-bounded matroid basis and low congestion routing.


Random Walk Fractional Solution Multiplicative Error Iterate Rounding Violation Bound 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Bansal, N.: Constructive algorithms for discrepancy minimization. In: Foundations of Computer Science (FOCS), pp. 3–10 (2010)Google Scholar
  2. 2.
    Bansal, N., Charikar, M., Krishnaswamy, R., Li, S.: Better algorithms and hardness for broadcast scheduling via a discrepancy approach. In: SODA, pp. 55–71 (2014)Google Scholar
  3. 3.
    Bansal, N., Khandekar, R., Könemann, J., Nagarajan, V., Peis, B.: On generalizations of network design problems with degree bounds. Math. Program. 141(1–2), 479–506 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Bansal, N., Nagarajan, V.: Approximation-friendly discrepancy rounding. CoRR abs/1512.02254 (2015)Google Scholar
  5. 5.
    Beck, J., Fiala, T.: Integer-making theorems. Discrete Appl. Math. 3, 1–8 (1981)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Charikar, M., Newman, A., Nikolov, A.: Tight hardness results for minimizing discrepancy. In: SODA, pp. 1607–1614 (2011)Google Scholar
  7. 7.
    Chekuri, C., Vondrak, J., Zenklusen, R.: Dependent randomized rounding via exchange properties of combinatorial structures. In: FOCS, pp. 575–584 (2010)Google Scholar
  8. 8.
    Grandoni, F., Ravi, R., Singh, M., Zenklusen, R.: New approaches to multi-objective optimization. Math. Program. 146(1–2), 525–554 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Harvey, N.J.A., Schwartz, R., Singh, M.: Discrepancy without partial colorings. In: APPROX/RANDOM 2014, pp. 258–273 (2014)Google Scholar
  10. 10.
    Karp, R.M., Leighton, F.T., Rivest, R.L., Thompson, C.D., Vazirani, U.V., Vazirani, V.V.: Global wire routing in two-dimensional arrays. Algorithmica 2, 113–129 (1987)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Király, T., Lau, L.C., Singh, M.: Degree bounded matroids and submodular flows. In: Lodi, A., Panconesi, A., Rinaldi, G. (eds.) IPCO 2008. LNCS, vol. 5035, pp. 259–272. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  12. 12.
    Lau, L.C., Ravi, R., Singh, M.: Iterative Methods in Combinatorial Optimization. Cambridge University Press, Cambridge (2011)CrossRefzbMATHGoogle Scholar
  13. 13.
    Leighton, F.T., Lu, C., Rao, S., Srinivasan, A.: New algorithmic aspects of the local lemma with applications to routing and partitioning. SIAM J. Comput. 31(2), 626–641 (2001)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Lovasz, L., Spencer, J., Vesztergombi, K.: Discrepancy of set-systems and matrices. Eur. J. Combin. 7, 151–160 (1986)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Lovett, S., Meka, R.: Constructive discrepancy minimization by walking on the edges. In: FOCS, pp. 61–67 (2012)Google Scholar
  16. 16.
    Matoušek, J.: Geometric Discrepancy: An Illustrated Guide. Springer, Heidelberg (2010)zbMATHGoogle Scholar
  17. 17.
    Nikolov, A., Talwar, K.: Approximating hereditary discrepancy via small width ellipsoids. In: Symposium on Discrete Algorithms, SODA, pp. 324–336 (2015)Google Scholar
  18. 18.
    Rothvoss, T.: Approximating bin packing within o(log OPT * log log OPT) bins. In: FOCS, pp. 20–29 (2013)Google Scholar
  19. 19.
    Rothvoss, T.: Constructive discrepancy minimization for convex sets. In: IEEE Symposium on Foundations of Computer Science, FOCS, pp. 140–145 (2014)Google Scholar
  20. 20.
    Singh, M., Lau, L.C.: Approximating minimum bounded degree spanning trees to within one of optimal. In: STOC, pp. 661–670 (2007)Google Scholar
  21. 21.
    Spencer, J.: Six standard deviations suffice. Trans. Am. Math. Soc. 289(2), 679–706 (1985)MathSciNetCrossRefzbMATHGoogle Scholar
  22. 22.
    Srinivasan, A.: Improving the discrepancy bound for sparse matrices: better approximations for sparse lattice approximation problems. In: Symposium on Discrete Algorithms (SODA), pp. 692–701 (1997)Google Scholar
  23. 23.
    Vazirani, V.V.: Approximation Algorithms. Springer-Verlag, Heidelberg (2001)zbMATHGoogle Scholar
  24. 24.
    Williamson, D., Shmoys, D.: The Design of Approximation Algorithms. Cambridge University Press, Cambridge (2011)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.Department of Mathematics and Computer ScienceEindhoven University of TechnologyEindhovenThe Netherlands
  2. 2.Department of Industrial and Operations EngineeringUniversity of MichiganAnn ArborUSA

Personalised recommendations