34 citations · 78 across the 11 of their papers we have counts for
4 papers · 1 filter
Balancing Relevance and Diversity in Online Bipartite Matching via Submodularity
John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan +1
In bipartite matching problems, vertices on one side of a bipartite graph are paired with those on the other. In its online variant, one side of the graph is available offline, whi…
A PTAS for a Class of Stochastic Dynamic Programs
Hao Fu, Jian Li, Pan Xu
We develop a framework for obtaining polynomial time approximation schemes (PTAS) for a class of stochastic dynamic programs. Using our framework, we obtain the first PTAS for the…
Attenuate Locally, Win Globally: An Attenuation-based Framework for Online Stochastic Matching with Timeouts
Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan +1
Online matching problems have garnered significant attention in recent years due to numerous applications in e-commerce, online advertisements, ride-sharing, etc. Many of them capt…
Onion Curve: A Space Filling Curve with Near-Optimal Clustering
Pan Xu, Cuong Nguyen, Srikanta Tirthapura
Space filling curves (SFCs) are widely used in the design of indexes for spatial and temporal data. Clustering is a key metric for an SFC, that measures how well the curve preserve…