47 citations · 236 across the 38 of their papers we have counts for
43 papers
Improved Bi-point Rounding Algorithms and a Golden Barrier for -Median
Kishen N. Gowda, Thomas Pensyl, Aravind Srinivasan +1
The current best approximation algorithms for -median rely on first obtaining a structured fractional solution known as a bi-point solution, and then rounding it to an integer s…
Controlling Epidemic Spread using Probabilistic Diffusion Models on Networks
Amy Babay, Michael Dinitz, Aravind Srinivasan +2
The spread of an epidemic is often modeled by an SIR random process on a social network graph. The MinINF problem for optimal social distancing involves minimizing the expected num…
Deploying Vaccine Distribution Sites for Improved Accessibility and Equity to Support Pandemic Response
George Li, Ann Li, Madhav Marathe +3
In response to COVID-19, many countries have mandated social distancing and banned large group gatherings in order to slow down the spread of SARS-CoV-2. These social interventions…
Rawlsian Fairness in Online Bipartite Matching: Two-sided, Group, and Individual
Seyed A. Esmaeili, Sharmila Duppala, Davidson Cheng +3
Online bipartite-matching platforms are ubiquitous and find applications in important areas such as crowdsourcing and ridesharing. In the most general form, the platform consists o…
Planning to Fairly Allocate: Probabilistic Fairness in the Restless Bandit Setting
Christine Herlihy, Aviva Prins, Aravind Srinivasan +1
Restless and collapsing bandits are often used to model budget-constrained resource allocation in settings where arms have action-dependent transition probabilities, such as the al…
Fair Clustering Under a Bounded Cost
Seyed A. Esmaeili, Brian Brubach, Aravind Srinivasan +1
Clustering is a fundamental unsupervised learning problem where a dataset is partitioned into clusters that consist of nearby points in a metric space. A recent variant, fair clust…