Non-uniform Geometric Set Cover and Scheduling on Multiple Machines

von Bansal, Nikhil
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (32. : 2021 : Online) Thirty-second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2021) ; Volume 4 of 4 (2021)

Contention Resolution, Matrix Scaling and Fair Allocation

von Bansal, Nikhil
Veröffentlicht in WAOA (19. : 2021 : Online) Approximation and online algorithms (2021)

Achievable performance of blind policies in heavy traffic

von Bansal, Nikhil
Veröffentlicht in Mathematics of operations research (2018)

Improved Approximations for Min Sum Vertex Cover and Generalized Min Sum Set Cover

von Bansal, Nikhil
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (32. : 2021 : Online) Thirty-second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2021) ; Volume 2 of 4 (2021)

The local-global conjecture for scheduling with non-linear cost

von Bansal, Nikhil
Veröffentlicht in Journal of scheduling (2017)

Algorithms - ESA 2015 : 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, proceedings

Veröffentlicht 2015

Online Discrepancy Minimization for Stochastic Arrivals

von Bansal, Nikhil
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (32. : 2021 : Online) Thirty-second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2021) ; Volume 4 of 4 (2021)