research
∙
10/10/2022
A Hierarchical Grouping Algorithm for the Multi-Vehicle Dial-a-Ride Problem
Ride-sharing is an essential aspect of modern urban mobility. In this pa...
share
research
∙
11/15/2021
Finding Optimal Tangent Points for Reducing Distortions of Hard-label Attacks
One major problem in black-box adversarial attacks is the high query com...
research
∙
10/29/2021
Online Food Delivery to Minimize Maximum Flow Time
We study a common delivery problem encountered in nowadays online food-o...
research
∙
10/19/2020
Robust High Dimensional Expectation Maximization Algorithm via Trimmed Hard Thresholding
In this paper, we study the problem of estimating latent variable models...
research
∙
10/19/2020
Estimating Stochastic Linear Combination of Non-linear Regressions Efficiently and Scalably
Recently, many machine learning and statistical models such as non-linea...
research
∙
08/13/2020
Consistent k-Median: Simpler, Better and Robust
In this paper we introduce and study the online consistent k-clustering ...
research
∙
02/25/2020
The Power of Recourse: Better Algorithms for Facility Location in Online and Dynamic Models
In this paper we study the facility location problem in the online with ...
research
∙
07/26/2019
Tight Approximation for Variants of Directed Steiner Tree via State-Tree Decomposition and Linear Programming Rounding
Directed Steiner Tree (DST) is a central problem in combinatorial optimi...
research
∙
10/18/2018