### Research Interests

Broadly speaking, my research area is theoretical computer science. Specifically, I am interested in designing and analyzing approximation algorithms for NP-hard combinatorial problems. Main types of problems I worked on include facility location problems, network routing and design, scheduling, resource allocation problems, etc.

My research is supported by NSF grant CCF-1566356 and CCF-1717134.

### Sample Papers

Here is the full list of my publications.

*O*(log^{2}*k*/loglog*k*)-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial-Time Algorithm (arxiv)[Abstract]

*Bundit Laekhanukit, Fabrizio Grandoni and S. Li*

Manuscript

- Lift and Project Algorithms for Precedence Constrained Scheduling to Minimize Completion Time

*Shashwat Garg, Janardhan Kulkarni and S. Li*

SODA 2019

- A Polynomial Time Constant Approximation For Minimizing Total Weighted Flow-time (arxiv)[Abstract]

*Uri Feige, Janardhan Kulkarni and S. Li*

SODA 2019

- On Facility Location with General Lower Bounds (arxiv)[Abstract]

*S. Li*

SODA 2019

- Distributed k-Clustering for Data with Heavy Noise [Abstract]

*Xiangyu Guo and S. Li*

NIPS 2018 (Spotlight)

- Constant Approximation for k-Median and k-Means with Outliers via Iterative Rounding (arxiv)[Abstract]

*Ravishankar Krishnaswamy, S. Li and Sai Sandeep*

STOC 2018

- Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations (arxiv)[Abstract]

*S. Li*

FOCS 2017

**invited to a special issue of SICOMP**

- On (1,
*ε*)-Restricted Asgsignment Makespan Minimization (arxiv)[Abstract]

*Deeparnab Chakrabarty, Sanjeev Khanna and S. Li*

SODA 2015

- Approximating
*k*-Median via Pseudo-Approximation (arxiv)[Abstract]

*S. Li and Ola Svensson*

STOC 2013

- A Polylogarithmic Approximation for Edge-Disjoint-Paths with Congestion 2 (arxiv)[Abstract]

*Julia Chuzhoy and S. Li*

FOCS 2012

**co-winner of best paper award**

- A 1.488-Approximation Algorithm for the Uncapacitated Facility Location Problem [Abstract]

*S. Li*

ICALP 2011

**best student paper of Track A**

### Teaching

- Currently Teaching: Topics in Combinatorial Optimization and Linear Programming (Seminar)
- CSE431/531: Algorithm Analysis and Design (Spring 2018, Fall 2016, Spring 2016)
- CSE 632: Analysis of Algorithms II (Fall 2017)
- Advanced Topics in Algorithm Design (Seminar) (Fall 2015)
- EECS336: Design and Analysis of Algorithms (Winter 2015) at Northwestern University
- co-teaching Information and Coding Theory (Fall 2014) at TTIC with Madhur Tulsiani

### PhD Advisees

- Xiangyu Guo
- Yunus Esencayi (co-advising with Prof. Roger He)
- Jiayi Xian (co-advising with Prof. Jinhui Xu)
- Alexander Stachnik

### Professional Activities

PC member for APPROX+RANDOM 2017, SWAT 2018, MAPSP 2019 (upcoming)