1 citations · 1 across the 1 of their papers we have counts for
2 papers
cs.DS2017
Quasi-PTAS for Scheduling with Precedences using LP Hierarchies
Shashwat Garg
A central problem in scheduling is to schedule unit size jobs with precedence constraints on identical machines so as to minimize the makespan. For , 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 vectors in of norm at most and any convex body in …