2 citations · 5 across the 10 of their papers we have counts for
9 papers · 1 filter
Ads that Stick: Near-Optimal Ad Optimization through Psychological Behavior Models
Kailash Gopal Darmasubramanian, Akash Pareek, Arindam Khan +1
Optimizing the timing and frequency of ads is a central problem in digital advertising, with significant economic consequences. Existing scheduling policies rely on simple heuristi…
Bin Packing under Random-Order: Breaking the Barrier of 3/2
Anish Hebbar, Arindam Khan, K. V. N. Sreenivas
Best-Fit is one of the most prominent and practically used algorithms for the bin packing problem, where a set of items with associated sizes needs to be packed in the minimum numb…
Fair Rank Aggregation
Diptarka Chakraborty, Syamantak Das, Arindam Khan +1
Ranking algorithms find extensive usage in diverse areas such as web search, employment, college admission, voting, etc. The related rank aggregation problem deals with combining m…
Approximation Algorithms for ROUND-UFP and ROUND-SAP
Debajyoti Kar, Arindam Khan, Andreas Wiese
We study ROUND-UFP and ROUND-SAP, two generalizations of the classical BIN PACKING problem that correspond to the unsplittable flow problem on a path (UFP) and the storage allocati…
A PTAS for Packing Hypercubes into a Knapsack
Klaus Jansen, Arindam Khan, Marvin Lira +1
We study the d-dimensional hypercube knapsack problem where we are given a set of d-dimensional hypercubes with associated profits, and a knapsack which is a unit d-dimensional hyp…
Tight Approximation Algorithms for Two Dimensional Guillotine Strip Packing
Arindam Khan, Aditya Lonkar, Arnab Maiti +2
In the Strip Packing problem (SP), we are given a vertical half-strip and a set of axis-aligned rectangles of width at most . The goal is to find a n…