research
∙
11/29/2022
Online Unrelated-Machine Load Balancing and Generalized Flow with Recourse
We consider the online unrelated-machine load balancing problem with rec...
share
research
∙
10/22/2022
OOD-DiskANN: Efficient and Scalable Graph ANNS for Out-of-Distribution Queries
State-of-the-art algorithms for Approximate Nearest Neighbor Search (ANN...
research
∙
05/08/2022
Results of the NeurIPS'21 Challenge on Billion-Scale Approximate Nearest Neighbor Search
Despite the broad range of algorithms for Approximate Nearest Neighbor S...
research
∙
11/11/2021
Online Discrepancy with Recourse for Vectors and Graphs
The vector-balancing problem is a fundamental problem in discrepancy the...
research
∙
05/20/2021
FreshDiskANN: A Fast and Accurate Graph-Based ANN Index for Streaming Similarity Search
Approximate nearest neighbor search (ANNS) is a fundamental building blo...
research
∙
07/21/2020
Online Carpooling using Expander Decompositions
We consider the online carpooling problem: given n vertices, a sequence ...
research
∙
11/28/2019
PERMUTATION Strikes Back: The Power of Recourse in Online Metric Matching
In the classical Online Metric Matching problem, we are given a metric s...
research
∙
11/03/2017
Constant Approximation for k-Median and k-Means with Outliers via Iterative Rounding
In this paper, we present a novel iterative rounding framework for many ...
research
∙
07/08/2017