scientific article; zbMATH DE number 6472647

MaRDI QIDQ5501849zbMATH OpenFDO

Authors Aravind Srinivasan

Publication date 14 August 2015

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Combinatorics in computer science (68R05)

Cited in

(11)

• Recent progress on combinatorics and algorithms for low discrepancy roundings
• Better bin packing approximations via discrepancy theory
• Constructive Discrepancy Minimization for Convex Sets
• Constructive discrepancy minimization by walking on the edges
• An algorithm for Komlós conjecture matching Banaszczyk's bound
• A note on the discrepancy of matrices with bounded row and column sums
• Algorithmic aspects of combinatorial discrepancy
• The entropy rounding method in approximation algorithms
• A size-sensitive discrepancy bound for set systems of bounded primal shatter dimension
• Semidefinite optimization in discrepancy theory
• Matrix approximation and Tusnády's problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501849)