From the 1 of 25 linked papers with an AI index.
25 papers
Approximation Algorithms for Geometric Maximum Coverage
Sujoy Bhore, Timothy M. Chan, Pasin Manurangsi
We study the maximum coverage problem for geometric set systems: given a set of points, a set of geometric objects, and a number , select objects maximizing the number of po…
Online TCP Acknowledgment under General Delays
Sujoy Bhore, MichaÅ PawÅowski, Seeun William Umboh
The paper investigates the online TCP acknowledgment problem under generalized delay-cost models, analyzing the competitive performance of greedy algorithms for batch-aware and bat…
Explaining Rankings with Hidden Group Bonuses
Alvin Hong Yao Yan, Suraj Shetiya, Sujoy Bhore +2
Determining a linear utility function that correlates with observed candidate rankings is a foundational problem with applications in domains such as admissions, hiring, and recomm…
Optimal Regret for Single Index Bandits
Devdan Dey, Sujoy Bhore, Avishek Ghosh
We study the problem, where rewards depend on an unknown one-dimensional projection of high-dimensional contexts through an unknown reward function.…
Visibility Queries in Simple Polygons
Sujoy Bhore, Chih-Hung Liu, Anurag Murty Naredla +6
Given a simple polygon with vertices, we consider the problem of constructing a data structure for visibility queries: for any query point , compute the visibility…
DAG Covers: The Steiner Point Effect
Sujoy Bhore, Hsien-Chih Chang, Jonathan Conroy +4
Given a weighted digraph , a -DAG cover is a collection of dominating DAGs such that all distances are approximately preserved: for every pair $(u,…