Algorithmic discrepancy beyond partial coloring

DOI10.1145/3055399.3055490zbMath1369.68229arXiv1611.01805OpenAlexW2551238896MaRDI QIDQ4978034

Nikhil Bansal, Shashwat Garg

Publication date: 17 August 2017

Published in: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1611.01805

zbMATH Keywords

semidefinite programmingrandom walksdiscrepancyrounding techniques

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Semidefinite programming (90C22)

Related Items (6)

A Spectral Approach to Network Design ⋮ Discrepancy theory and related algorithms ⋮ TIGHTER BOUNDS FOR THE DISCREPANCY OF BOXES AND POLYTOPES ⋮ An Algorithm for Komlós Conjecture Matching Banaszczyk's Bound ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: Algorithmic discrepancy beyond partial coloring