• Algorithms for Fair Clustering 

      Allabadi, Swati
      Many decisions today are taken by various machine learning algorithms, hence it is crucial to accommodate fairness in such algorithms to remove/reduce any kind of bias in the decision. We incorporate fairness in the ...
    • Algorithms for Geometric Packing and Covering Problems 

      Lonkar, Aditya Abhay
      We study two fundamental problems related to geometric packing and covering, and design algorithms with improved worst-case performance guarantees for them. These problems have numerous applications in resource allocation, ...
    • Approximation Algorithms for Geometric Packing Problems 

      Sharma, Eklavya
      We study approximation algorithms for the geometric bin packing problem and its variants. In the two-dimensional geometric bin packing problem (2D GBP), we are given n rectangular items and we have to compute an axis-parallel ...
    • Improved Algorithms for Variants of Bin Packing and Knapsack 

      Karnati, Venkata Naga Sreenivasulu
      We study variants of two classical optimization problems: Bin Packing and Knapsack. Both bin packing and knapsack fall under the regime of "Packing and Covering Problems". In bin packing, we are given a set of input items, ...