The following pages link to Shashwat Garg (Q265720):
Displaying 13 items.
- Tighter estimates for \(\epsilon\)-nets for disks (Q265723) (← links)
- Limits of local search: quality and efficiency (Q527441) (← links)
- (Q2954994) (← links)
- An Algorithm for Komlós Conjecture Matching Banaszczyk's Bound (Q4634029) (← links)
- Towards a Constructive Version of Banaszczyk's Vector Balancing Theorem (Q4636461) (← links)
- Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems (Q4687248) (← links)
- Faster space-efficient algorithms for subset sum and k-sum (Q4977972) (← links)
- Algorithmic discrepancy beyond partial coloring (Q4978034) (← links)
- Quasi-PTAS for scheduling with precedences using LP hierarchies (Q5002735) (← links)
- (Q5215661) (← links)
- (Q5215668) (← links)
- The Gram-Schmidt walk: a cure for the Banaszczyk blues (Q5230322) (← links)
- Lift and Project Algorithms for Precedence Constrained Scheduling to Minimize Completion Time (Q5236279) (← links)
