3 papers
cs.DS2026
Some variations of the secretary problem
Sarthak Agrawal, Sanjeev Saxena
We consider two variations of the classical secretary problem. * A variation of the returning secretary problem where each interviewee may appear a second time with a fixed probabi…
cs.DS2024
Top-k Stabbing Interval Queries
Waseem Akram, Sanjeev Saxena
We investigate a weighted variant of the interval stabbing problem, where the goal is to design an efficient data structure for a given set of weighted intervals such…
cs.DS2024
Maximizing Weighted Dominance in the Plane
Waseem Akram, Sanjeev Saxena
Let P be a set of n weighted points, Q be a set of m unweighted points in the plane, and k a non-negative integer. We consider the problem of computing a subset wit…