1 citations · 3 across the 9 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
cs.DS2022
Near-optimal Algorithms for Stochastic Online Bin Packing
Nikhil Ayyadevara, Rajni Dabas, Arindam Khan +1
We study the online bin packing problem under two stochastic settings. In the bin packing problem, we are given n items with sizes in (0,1] and the goal is to pack them into the mi…
cs.DS2022
Constant factor approximations for Lower and Upper bounded Clusterings
Neelima Gupta, Sapna Grover, Rajni Dabas
Clustering is one of the most fundamental problem in Machine Learning. Researchers in the field often require a lower bound on the size of the clusters to maintain anonymity and up…
cs.DS2022★ 1 cited
Locating Charging Stations: Connected, Capacitated and Prize- Collecting
Rajni Dabas, Neelima Gupta
In this paper, we study locating charging station problem as facility location problem and its variants (-Median, -Facility location and -center). We study the connectivit…