23 citations · 75 across the 33 of their papers we have counts for
39 papers
Efficient Algorithms for Online Subadditive Combinatorial Allocations
Calum MacRury, Rian Neogi, Kanstantsin Pashkovich +4
For the online combinatorial allocation problem with subadditive valuations, Correa and Cristi (STOC 2023) proved the existence of a -competitive online algorithm, improving on…
Stochastic Load Balancing with Machine Reservations
David Alemán Espinosa, Naveen Garg, Sharat Ibrahimpur +2
We introduce a novel variant of stochastic load balancing that enables a quantitative tradeoff between the practical benefits of non-adaptive policies and their performance limitat…
Approximation Algorithms for Norm-Budgeted Packing Problems
David Aleman Espinosa, Sharat Ibrahimpur, Chaitanya Swamy
In recent years, much attention has been devoted to the study of optimization problems under norm-based objectives coming from the rich class of monotone, symmetric norms (and thei…
Approximation Algorithms for Correlated Knapsack Orienteering
David Aleman Espinosa, Chaitanya Swamy
We consider the {\em correlated knapsack orienteering} (CSKO) problem: we are given a travel budget , processing-time budget , finite metric space with root ,…
On the Randomized Metric Distortion Conjecture
Haripriya Pulyassary, Chaitanya Swamy
In the single winner determination problem, we have n voters and m candidates and each voter j incurs a cost c(i, j) if candidate i is chosen. Our objective is to choose a candidat…
Combinatorial Algorithms for Rooted Prize-Collecting Walks and Applications to Orienteering and Minimum-Latency Problems
Sina Dezfuli, Zachary Friggstad, Ian Post +1
We consider the rooted prize-collecting walks (PCW) problem, wherein we seek a collection of rooted walks having minimum prize-collecting cost, which is the (total cost of walk…