Vertex Sparsifiers and Abstract Rounding Algorithms. - Moses Charikar; Tom Leighton; Shi Li 001; Ankur Moitra (FOCS, 2010)

On constant factor approximation for earth mover distance over doubling metrics - Shi Li 001 (CoRR, 2010)

Multicast Capacity of Wireless Ad Hoc Networks Under Gaussian Channel Model. - Xiang-Yang Li 001; Yunhao Liu 001; Shi Li 001; Shaojie Tang 001 (IEEE/ACM Trans. Netw., 2010)

A Dependent LP-Rounding Approach for the k-Median Problem. - Moses Charikar; Shi Li 001 (ICALP (1), 2012)

Approximation algorithms and hardness of integral concurrent flow. - Parinya Chalermsook; Julia Chuzhoy; Alina Ene; Shi Li 001 (STOC, 2012)

A Polylogarithimic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2 - Julia Chuzhoy; Shi Li 001 (CoRR, 2012)

Capacitated Network Design on Undirected Graphs. - Deeparnab Chakrabarty; Ravishankar Krishnaswamy; Shi Li 001; Srivatsan Narayanan (APPROX-RANDOM, 2013)

A Constant Factor Approximation Algorithm for Fault-Tolerant k-Median. - Mohammad Taghi Hajiaghayi; Wei Hu; Jian Li 015; Shi Li 001; Barna Saha (CoRR, 2013)

Traffic Congestion in Expanders, $(p,δ)$–Hyperbolic Spaces and Product of Trees - Shi Li 001; Gabriel H. Tucci (CoRR, 2013)

A 1.488 approximation algorithm for the uncapacitated facility location problem. - Shi Li 001 (Inf. Comput., 2013)

Better Algorithms and Hardness for Broadcast Scheduling via a Discrepancy Approach. - Nikhil Bansal 001; Moses Charikar; Ravishankar Krishnaswamy; Shi Li 001 (SODA, 2014)

On $(1, ε)$-Restricted Assignment Makespan Minimization. - Deeparnab Chakrabarty; Sanjeev Khanna; Shi Li 001 (CoRR, 2014)

On Uniform Capacitated $k$-Median Beyond the Natural LP Relaxation. - Shi Li 001 (CoRR, 2014)

Approximating capacitated $k$-median with $(1+ε)k$ open facilities. - Shi Li 001 (CoRR, 2014)

Deriving Vegetation Phenological Time and Trajectory Information Over Africa Using SEVIRI Daily LAI. - Kaiyu Guan; David Medvigy; Eric F. Wood; Kelly K. Caylor; Shi Li 001; Su-Jong Jeong (IEEE Trans. Geosci. Remote. Sens., 2014)

Approximation Algorithms for Network Routing and Facility Location Problems - Shi Li 001 (2014)

On (1, ∊)-Restricted Assignment Makespan Minimization. - Deeparnab Chakrabarty; Sanjeev Khanna; Shi Li 001 (SODA, 2015)

A Dynamic Programming Framework for Non-Preemptive Scheduling Problems on Multiple Machines [Extended Abstract]. - Sungjin Im; Shi Li 001; Benjamin Moseley; Eric Torng (SODA, 2015)

Traffic Congestion in Expanders and (p, δ)-Hyperbolic Spaces. - Shi Li 001; Gabriel H. Tucci (Internet Math., 2015)

Better Unrelated Machine Scheduling for Weighted Completion Time via Random Offsets from Non-uniform Distributions. - Sungjin Im; Shi Li 001 (FOCS, 2016)

Constant Approximation for Capacitated k-Median with (1+epsilon)-Capacity Violation. - H. Gökalp Demirci; Shi Li 001 (ICALP, 2016)

Approximating capacitated k-median with (1 + ∊)k open facilities. - Shi Li 001 (SODA, 2016)

Improved approximation for node-disjoint paths in planar graphs. - Julia Chuzhoy; David H. K. Kim; Shi Li 001 (STOC, 2016)

Constant Approximation for Capacitated k-Median with (1 + ε)-Capacity Violation. - H. Gökalp Demirci; Shi Li 001 (CoRR, 2016)

Tight Network Topology Dependent Bounds on Rounds of Communication. - Arkadev Chattopadhyay; Michael Langberg; Shi Li 001; Atri Rudra (Electron. Colloquium Comput. Complex., 2016)

A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2. - Julia Chuzhoy; Shi Li 001 (J. ACM, 2016)

Approximating k-Median via Pseudo-Approximation. - Shi Li 001; Ola Svensson (SIAM J. Comput., 2016)

On the Computational Complexity of Minimum-Concave-Cost Flow in a Two-Dimensional Grid. - Shabbir Ahmed 001; Qie He; Shi Li 001; George L. Nemhauser (SIAM J. Optim., 2016)

A Constant Factor Approximation Algorithm for Fault-Tolerant k-Median. - Mohammad Taghi Hajiaghayi; Wei Hu; Jian Li 015; Shi Li 001; Barna Saha (ACM Trans. Algorithms, 2016)

Breaking 1 - 1/e Barrier for Non-preemptive Throughput Maximization. - Sungjin Im; Shi Li 001; Benjamin Moseley (IPCO, 2017)

Constant Approximation Algorithm for Non-Uniform Capacitated Multi-Item Lot-Sizing via Strong Covering Inequalities. - Shi Li 001 (SODA, 2017)

On Uniform Capacitated k-Median Beyond the Natural LP Relaxation. - Shi Li 001 (ACM Trans. Algorithms, 2017)

Flow-time Optimization for Concurrent Open-Shop and Precedence Constrained Scheduling Models. - Janardhan Kulkarni; Shi Li 001 (APPROX-RANDOM, 2018)

Distributed k-Clustering for Data with Heavy Noise. - Shi Li 001; Xiangyu Guo (NeurIPS, 2018)

Constant approximation for k-median and k-means with outliers via iterative rounding. - Ravishankar Krishnaswamy; Shi Li 001; Sai Sandeep (STOC, 2018)

O(log2k/log log k)-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial-Time Algorithm. - Fabrizio Grandoni 001; Bundit Laekhanukit; Shi Li 001 (CoRR, 2018)

Automating CSI Measurement with UAVs: from Problem Formulation to Energy-Optimal Solution. - Sixu Piao; Zhongjie Ba; Lu Su 001; Dimitrios Koutsonikolas; Shi Li 001; Kui Ren 001 (INFOCOM, 2019)

Facility Location Problem in Differential Privacy Model Revisited. - Yunus Esencayi; Marco Gaboardi; Shi Li 001; Di Wang 015 (NeurIPS, 2019)

Topology Dependent Bounds For FAQs. - Michael Langberg; Shi Li 001; Sai Vikneshwar Mani Jayaraman; Atri Rudra (PODS, 2019)

A Polynomial Time Constant Approximation For Minimizing Total Weighted Flow-time. - Uriel Feige; Janardhan Kulkarni; Shi Li 001 (SODA, 2019)

Lift and Project Algorithms for Precedence Constrained Scheduling to Minimize Completion Time. - Shashwat Garg; Janardhan Kulkarni; Shi Li 001 (SODA, 2019)

On Facility Location with General Lower Bounds. - Shi Li 001 (SODA, 2019)

O(log2 k / log log k)-approximation algorithm for directed Steiner tree: a tight quasi-polynomial-time algorithm. - Fabrizio Grandoni 001; Bundit Laekhanukit; Shi Li 001 (STOC, 2019)

Tight Approximation for Variants of Directed Steiner Tree via State-Tree Decomposition and Linear Programming Rounding. - Xiangyu Guo; Bundit Laekhanukit; Shi Li 001; Jiayi Xian (CoRR, 2019)

Approximation Algorithms for Stochastic Clustering. - David G. Harris 001; Shi Li 001; Thomas W. Pensyl; Aravind Srinivasan; Khoa Trinh (J. Mach. Learn. Res., 2019)

$O( log^2{k}/ log log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm. - Fabrizio Grandoni 001; Bundit Laekhanukit; Shi Li 001 (SIAM J. Comput., 2019)

Estimating Stochastic Linear Combination of Non-Linear Regressions. - Di Wang 015; Xiangyu Guo; Chaowen Guan; Shi Li 001; Jinhui Xu 001 (AAAI, 2020)

On the Facility Location Problem in Online and Dynamic Models. - Xiangyu Guo; Janardhan Kulkarni; Shi Li 001; Jiayi Xian (APPROX-RANDOM, 2020)

Hierarchy-Based Algorithms for Minimizing Makespan under Precedence and Communication Constraints. - Janardhan Kulkarni; Shi Li 001; Jakub Tarnawski; Minwei Ye (SODA, 2020)

Approximating Global Optimum for Probabilistic Truth Discovery. - Shi Li 001; Jinhui Xu 001; Minwei Ye (Algorithmica, 2020)

The Power of Recourse: Better Algorithms for Facility Location in Online and Dynamic Models. - Xiangyu Guo; Janardhan Kulkarni; Shi Li 001; Jiayi Xian (CoRR, 2020)

Covering the Relational Join. - Shi Li 001; Sai Vikneshwar Mani Jayaraman; Atri Rudra (CoRR, 2020)

Estimating stochastic linear combination of non-linear regressions efficiently and scalably. - Di Wang 015; Xiangyu Guo; Chaowen Guan; Shi Li 001; Jinhui Xu 001 (Neurocomputing, 2020)

Robust high dimensional expectation maximization algorithm via trimmed hard thresholding. - Di Wang 015; Xiangyu Guo; Shi Li 001; Jinhui Xu 001 (Mach. Learn., 2020)

Constant Approximation Algorithm for Nonuniform Capacitated Multi-Item Lot Sizing via Strong Covering Inequalities. - Shi Li 001 (Math. Oper. Res., 2020)

Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations. - Shi Li 001 (SIAM J. Comput., 2020)

Breaking 1 - 1/e Barrier for Nonpreemptive Throughput Maximization. - Sungjin Im; Shi Li 001; Benjamin Moseley (SIAM J. Discret. Math., 2020)

On the Hardness of Approximating the k-Way Hypergraph Cut problem. - Chandra Chekuri; Shi Li 001 (Theory Comput., 2020)

Consistent k-Median: Simpler, Better and Robust. - Xiangyu Guo; Janardhan Kulkarni; Shi Li 001; Jiayi Xian (AISTATS, 2021)

Online Unrelated Machine Load Balancing with Predictions Revisited. - Shi Li 001; Jiayi Xian (ICML, 2021)

Towards PTAS for Precedence Constrained Scheduling via Combinatorial Algorithms. - Shi Li 001 (SODA, 2021)

Online Food Delivery to Minimize Maximum Flow Time. - Xiangyu Guo; Shi Li 001; Kelin Luo; Yuhao Zhang 001 (CoRR, 2021)

On Facility Location Problem in the Local Differential Privacy Model. - Vincent Cohen-Addad; Yunus Esencayi; Chenglin Fan; Marco Gaboardi; Shi Li 001; Di Wang 015 (AISTATS, 2022)

Nested Active-Time Scheduling. - Nairen Cao; Jeremy T. Fineman; Shi Li 001; Julián Mestre; Katina Russell; Seeun William Umboh (ISAAC, 2022)

Brief Announcement: Nested Active-Time Scheduling. - Nairen Cao; Jeremy T. Fineman; Shi Li 001; Julián Mestre; Katina Russell; Seeun William Umboh (SPAA, 2022)

On Approximating Degree-Bounded Network Design Problems. - Xiangyu Guo; Guy Kortsarz; Bundit Laekhanukit; Shi Li 001; Daniel Vaz 001; Jiayi Xian (Algorithmica, 2022)

Handling Correlated Rounding Error via Preclustering: A 1.73-approximation for Correlation Clustering. - Vincent Cohen-Addad; Euiwoong Lee; Shi Li 001; Alantha Newman (FOCS, 2023)

Nearly-Linear Time LP Solvers and Rounding Algorithms for Scheduling Problems. - Shi Li 001 (ICALP, 2023)

Improved Approximations for Unrelated Machine Scheduling. - Sungjin Im; Shi Li 001 (SODA, 2023)

Online Unrelated-Machine Load Balancing and Generalized Flow with Recourse. - Ravishankar Krishnaswamy; Shi Li 001; Varun Suriyanarayana (STOC, 2023)

Polylogarithmic Approximation for Robust s-t Path. - Shi Li 001; Chenyang Xu 002; Ruilong Zhang 001 (CoRR, 2023)

Degrees and Network Design: New Problems and Approximations. - Michael Dinitz; Guy Kortsarz; Shi Li 001 (APPROX/RANDOM, 2024)

Polylogarithmic Approximations for Robust s-t Path. - Shi Li 001; Chenyang Xu 002; Ruilong Zhang 001 (ICALP, 2024)

A Note on Approximating Weighted Nash Social Welfare with Additive Valuations. - Yuda Feng; Shi Li 001 (ICALP, 2024)

Online Load and Graph Balancing for Random Order Inputs. - Sungjin Im; Ravi Kumar 001; Shi Li 001; Aditya Petety; Manish Purohit (SPAA, 2024)

Understanding the Cluster Linear Program for Correlation Clustering. - Nairen Cao; Vincent Cohen-Addad; Euiwoong Lee; Shi Li 001; Alantha Newman; Lukas Vogl (STOC, 2024)

Understanding the Cluster LP for Correlation Clustering. - Nairen Cao; Vincent Cohen-Addad; Euiwoong Lee; Shi Li 001; Alantha Newman; Lukas Vogl (CoRR, 2024)

Minimizing the Maximum Flow Time in the Online Food Delivery Problem. - Xiangyu Guo; Shi Li 001; Kelin Luo; Yuhao Zhang 001 (Algorithmica, 2024)

Simultaneously Approximating All Norms for Massively Parallel Correlation Clustering. - Nairen Cao; Shi Li 001; Jia Ye (ICALP, 2025)

Approximating Unrelated Machine Weighted Completion Time Using Iterative Rounding and Computer Assisted Proofs. - Shi Li 001 (SODA, 2025)

Solving the Correlation Cluster LP in Sublinear Time. - Nairen Cao; Vincent Cohen-Addad; Euiwoong Lee; Shi Li 001; David Rasmussen Lolck; Alantha Newman; Mikkel Thorup; Lukas Vogl; Shuyi Yan; Hanwen Zhang 003 (STOC, 2025)

Constant Approximation for Weighted Nash Social Welfare with Submodular Valuations. - Yuda Feng; Yang Hu; Shi Li 001; Ruilong Zhang 001 (STOC, 2025)

An Effective Method to Compensate for Testing Induced SBFET Degradation by Charging Deep-Level Interface Trap. - Tiexin Zhang; Fanyu Liu; Lei Shu; Siyuan Chen; Yuchong Wang; Yuchen Wu; Jing Wan; Yong Xu; Shi Li 001; Yuyang Ding; Bo Li 051; Zhengsheng Han; et al. (IEEE Access, 2025)

Radiation Dose Detector of γ-Ray Based on Transient Nonequilibrium Body Potential Under Pseudo-MOSFET Configuration. - Tiexin Zhang; Fanyu Liu; Lei Shu; Siyuan Chen; Yuchong Wang; Yuchen Wu; Jing Wan; Yong Xu; Shi Li 001; Yuyang Ding; Bo Li 051; Zhengsheng Han; et al. (IEEE Trans. Instrum. Meas., 2025)

Polynomial Integrality Gap of Flow LP for Directed Steiner Tree. - Shi Li 001; Bundit Laekhanukit (ACM Trans. Algorithms, 2025)

Nash Social Welfare with Submodular Valuations: Approximation Algorithms and Integrality Gaps. - Xiaohui Bei; Yuda Feng; Yang Hu; Shi Li 001; Ruilong Zhang 001 (CoRR, 2025)

Static to Dynamic Correlation Clustering. - Nairen Cao; Vincent Cohen-Addad; Euiwoong Lee; Shi Li 001; David Rasmussen Lolck; Alantha Newman; Mikkel Thorup; Lukas Vogl; Shuyi Yan; Hanwen Zhang 003 (CoRR, 2025)

Logarithmic Approximations for Fair k-Set Selection. - Shi Li 001; Chenyang Xu 002; Ruilong Zhang 001 (CoRR, 2025)