32 citations · 57 across the 8 of their papers we have counts for
19 papers · 1 filter
Polylogarithmic Approximation for Robust s-t Path
Shi Li, Chenyang Xu, Ruilong Zhang
The paper revisits the robust - path problem, one of the most fundamental problems in robust optimization. In the problem, we are given a directed graph with vertices and…
Online Food Delivery to Minimize Maximum Flow Time
Xiangyu Guo, Shi Li, Kelin Luo +1
We study a common delivery problem encountered in nowadays online food-ordering platforms: Customers order dishes online, and the restaurant delivers the food after receiving the o…
Consistent -Median: Simpler, Better and Robust
Xiangyu Guo, Janardhan Kulkarni, Shi Li +1
In this paper we introduce and study the online consistent -clustering with outliers problem, generalizing the non-outlier version of the problem studied in [Lattanzi-Vassilvits…
Hierarchy-Based Algorithms for Minimizing Makespan under Precedence and Communication Constraints
Janardhan Kulkarni, Shi Li, Jakub Tarnawski +1
We consider the classic problem of scheduling jobs with precedence constraints on a set of identical machines to minimize the makespan objective function. Understanding the exact a…
Towards PTAS for Precedence Constrained Scheduling via Combinatorial Algorithms
Shi Li
We study the classic problem of scheduling precedence constrained unit-size jobs on machines so as to minimize the makespan. In a recent breakthrough, Levey and Roth…
The Power of Recourse: Better Algorithms for Facility Location in Online and Dynamic Models
Xiangyu Guo, Janardhan Kulkarni, Shi Li +1
In this paper we study the facility location problem in the online with recourse and dynamic algorithm models. In the online with recourse model, clients arrive one by one and our…