A 1.488 approximation algorithm for the uncapacitated facility location problem S Li Information and Computation 222, 45-58, 2013 | 317 | 2013 |

Approximating k-median via pseudo-approximation S Li, O Svensson proceedings of the forty-fifth annual ACM symposium on theory of computing …, 2013 | 316 | 2013 |

Constant approximation for k-median and k-means with outliers via iterative rounding R Krishnaswamy, S Li, S Sandeep Proceedings of the 50th annual ACM SIGACT symposium on theory of computing …, 2018 | 120 | 2018 |

Capacity of large scale wireless networks under Gaussian channel model S Li, Y Liu, XY Li Proceedings of the 14th ACM international conference on Mobile computing and …, 2008 | 111 | 2008 |

On Uniform Capacitated *k*-Median Beyond the Natural LP RelaxationS Li ACM Transactions on Algorithms (TALG) 13 (2), 1-18, 2017 | 87 | 2017 |

Scheduling to minimize total weighted completion time via time-indexed linear programming relaxations S Li SIAM Journal on Computing 49 (4), FOCS17-409-FOCS17-440, 2020 | 76 | 2020 |

A polylogarithmic approximation algorithm for edge-disjoint paths with congestion 2 J Chuzhoy, S Li Journal of the ACM (JACM) 63 (5), 1-51, 2016 | 74* | 2016 |

Approximating capacitated *k*-median with (1 + ∊)*k* open facilitiesS Li Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016 | 71 | 2016 |

Vertex sparsifiers and abstract rounding algorithms M Charikar, T Leighton, S Li, A Moitra 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 265-274, 2010 | 66 | 2010 |

A Dependent LP-Rounding Approach for the *k*-Median ProblemM Charikar, S Li International Colloquium on Automata, Languages, and Programming, 194-205, 2012 | 57 | 2012 |

Constant Approximation for Capacitated -Median with -Capacity Violation G Demirci, S Li Proceedings of the 43rd International Colloquium on Automata, Languages, and …, 2016 | 53 | 2016 |

Multicast capacity of wireless ad hoc networks under Gaussian channel model XY Li, Y Liu, S Li, SJ Tang IEEE/ACM Transactions on Networking 18 (4), 1145-1157, 2009 | 49 | 2009 |

On (1,*∊*)-Restricted Assignment Makespan MinimizationD Chakrabarty, S Khanna, S Li Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete …, 2014 | 47 | 2014 |

*O*(log^{2} *k* / log log *k*)-approximation algorithm for directed Steiner tree: a tight quasi-polynomial-time algorithmF Grandoni, B Laekhanukit, S Li Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019 | 45 | 2019 |

Automating CSI measurement with UAVs: From problem formulation to energy-optimal solution S Piao, Z Ba, L Su, D Koutsonikolas, S Li, K Ren IEEE INFOCOM 2019-IEEE Conference on Computer Communications, 2404-2412, 2019 | 39 | 2019 |

A Constant Factor Approximation Algorithm for Fault-Tolerant *k*-MedianM Hajiaghayi, W Hu, J Li, S Li, B Saha ACM Transactions on Algorithms (TALG) 12 (3), 1-19, 2016 | 34 | 2016 |

Distributed -Clustering for Data with Heavy Noise S Li, X Guo Advances in Neural Information Processing Systems 31, 7838-7846, 2018 | 32 | 2018 |

Improved approximation for node-disjoint paths in planar graphs J Chuzhoy, DHK Kim, S Li Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016 | 29 | 2016 |

Better algorithms and hardness for broadcast scheduling via a discrepancy approach N Bansal, M Charikar, R Krishnaswamy, S Li Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014 | 28 | 2014 |

Better unrelated machine scheduling for weighted completion time via random offsets from non-uniform distributions S Im, S Li 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016 | 24 | 2016 |