1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.DS2025
Optimal 4-Approximation for the Correlated Pandora's Problem
Nikhil Bansal, Zhiyi Huang, Zixuan Zhu
The Correlated Pandora's Problem posed by Chawla et al. (2020) generalizes the classical Pandora's Problem by allowing the numbers inside the Pandora's boxes to be correlated. It a…
cs.DS2024
Sensitivity Sampling for -Means: Worst Case and Stability Optimal Coreset Bounds
Nikhil Bansal, Vincent Cohen-Addad, Milind Prabhu +2
Coresets are arguably the most popular compression paradigm for center-based clustering objectives such as -means. Given a point set , a coreset is a small, weighted summ…
cs.DS2023★ 1 cited
On Approximating Cutwidth and Pathwidth
Nikhil Bansal, Dor Katzelnick, Roy Schwartz
We study graph ordering problems with a min-max objective. A classical problem of this type is cutwidth, where given a graph we want to order its vertices such that the number of e…