S. Garg

activity

20152024

most citedAn Algorithm for Komlós Conjecture Matching Banaszczyk's bound

9 citations · 20 across the 7 of their papers we have counts for

collaborators

Showing 2017Show all

2 papers · 1 filter

cs.DS2017

Quasi-PTAS for Scheduling with Precedences using LP Hierarchies

Shashwat Garg

A central problem in scheduling is to schedule $n$ unit size jobs with precedence constraints on $m$ identical machines so as to minimize the makespan. For $m = 3$ , it is not even kn…

cs.DS2017★ 1 cited

The Gram-Schmidt Walk: A Cure for the Banaszczyk Blues

Nikhil Bansal, Daniel Dadush, Shashwat Garg +1

An important result in discrepancy due to Banaszczyk states that for any set of $n$ vectors in $R^{m}$ of $ℓ_{2}$ norm at most $1$ and any convex body $K$ in $R^{m}$ …