Browsing Computer Science and Automation (CSA) by Subject "Online Algorithms"

Now showing items 1-2 of 2

    • 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, ...

    • 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, ...