跳转到正文
栗师 / 研究方向
发表论文
会议论文、期刊论文及预印本。
会议论文
2026
- k-Clustering via Iterative Randomized RoundingJarosław Byrka, Yuhao Guo, Yang Hu, S. Li, Chengzhang Wan and Zaixuan WangFOCS 2026 (accepted)
- On Tight FPT Time Approximation Algorithms for k-Clustering ProblemsHan Dai, S. Li and Sijin PengICALP 2026正式发表版本
- New Convex Programming Technique for Nash Social Welfare and SchedulingYuda Feng, Weijiang Hu and S. LiICALP 2026正式发表版本
- Static to Dynamic Correlation ClusteringNairen Cao, Vincent Cohen-Addad, Euiwoong Lee, S. Li, David Rasmussen Lolck, Alantha Newman, Mikkel Thorup, Lukas Vogl, Shuyi Yan and Hanwen ZhangICALP 2026正式发表版本
- Randomized Rounding over Dynamic ProgramsEtienne Bamas, S. Li and Lars RohwedderSTOC 2026
- Nash Social Welfare with Submodular Valuations: Approximation Algorithms and Integrality GapsXiaohui Bei, Yuda Feng, Yang Hu, S. Li and Ruilong ZhangSTOC 2026
2025
- Complexity and Approximation Algorithms for Fixed Charge Transportation ProblemsYong Chen, S. Li and Zihao LiangTAMC 2025
- Learning-Augmented Streaming Algorithms for Correlation ClusteringYinhao Dong, Shan Jiang, S. Li and Pan PengNeurIPS 2025
- Logarithmic Approximations for Fair k-Set SelectionS. Li, Chenyang Xu and Ruilong ZhangIJCAI 2025正式发表版本
- Simultaneously Approximating All Norms for Massively Parallel Correlation ClusteringNairen Cao, S. Li and Jia YeICALP 2025
- Constant Approximation for Weighted Nash Social Welfare with Submodular ValuationsYuda Feng, Yang Hu, S. Li and Ruilong ZhangSTOC 2025
- Solving the Correlation Cluster LP in Sublinear TimeNairen Cao, Vincent Cohen-Addad, Euiwoong Lee, S. Li, David Rasmussen Lolck, Alantha Newman, Mikkel Thorup, Lukas Vogl, Shuyi Yan and Hanwen ZhangSTOC 2025arXiv
- Approximating Unrelated Machine Weighted Completion Time Using Iterative Rounding and Computer Assisted ProofsS. LiSODA 2025受邀发表于 Algorithmica 特刊
2022
- Nested Active-Time SchedulingNairen Cao, Jeremy T. Fineman, S. Li, Julián Mestre, Katina Russell and Seeun William UmbohISAAC 2022正式发表版本
- Online Food Delivery to Minimize Maximum Flow TimeXiangyu Guo, S. Li, Kelin Luo and Yuhao ZhangISAAC 2022
- On Facility Location Problem in the Local Differential Privacy ModelVincent Cohen-Addad, Yunus Esencayi, Chenglin Fan, Marco Gaboardi, S. Li and Di WangAISTATS 2022
- Polynomial Integrality Gap of Flow LP for Directed Steiner TreeS. Li and Bundit LaekhanukitSODA 2022
2020
- Robust High Dimensional Expectation Maximization Algorithm via Trimmed Hard ThresholdingDi Wang, Xiangyu Guo, S. Li and Jinhui XuACML 2020
- On the Facility Location Problem in Online and Dynamic ModelsXiangyu Guo, Janardhan Kulkarni, S. Li and Jiayi XianAPPROX 2020arXiv
- On Approximating Degree-Bounded Network Design ProblemsXiangyu Guo, Guy Kortsarz, Bundit Laekhanukit, S. Li, Daniel Vaz and Jiayi XianAPPROX 2020arXiv
- Estimating Stochastic Linear Combination of Non-linear RegressionsDi Wang, Xiangyu Guo, Chaowen Guan, S. Li and Jinhui XuAAAI 2020arXiv（扩展版）
- Hierarchy-Based Algorithms for Minimizing Makespan under Precedence and Communication ConstraintsJanardhan Kulkarni, S. Li, Jakub Tarnawski and Minwei YeSODA 2020arXiv
2019
- Differentially Private Facility Location RevisitedYunus Esencayi, Marco Gaboardi, S. Li and Di WangNeurIPS 2019
- O(log2k/loglog k)-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial-Time AlgorithmFabrizio Grandoni, Bundit Laekhanukit and S. LiSTOC 2019受邀发表于 SICOMP 特刊
- Automating CSI Measurement with UAVs: from Problem Formulation to Energy-Optimal SolutionSixu Piao, Zhongjie Ba, Lu Su, Dimitrios Koutsonikolas, S. Li and Kui RenINFOCOM 2019
- Topology Dependent Bounds for (Some) FAQsMichael Langberg, S. Li, Sai Vikneshwar Mani Jayaraman and Atri RudraPODS 2019
- Lift and Project Algorithms for Precedence Constrained Scheduling to Minimize Completion TimeShashwat Garg, Janardhan Kulkarni and S. LiSODA 2019
- On Facility Location with General Lower BoundsS. LiSODA 2019
- A Polynomial Time Constant Approximation For Minimizing Total Weighted Flow-timeUri Feige, Janardhan Kulkarni and S. LiSODA 2019
期刊论文
2020
- On the Hardness of Approximating the k-Way Hypergraph Cut ProblemChandra Chekuri and S. LiTheory of Computing, 16, Article 14, 1–8, 2020正式发表版本
- Breaking 1-1/e Barrier for Non-preemptive Throughput MaximizationSungjin Im, S. Li and Benjamin MoseleySIAM Journal on Discrete Mathematics, 34(3), 1649–1669, 2020
- Approximating global optimum for probabilistic truth discoveryS. Li, Jinhui Xu and Minwei YeAlgorithmica, 82(10), 3091–3116, 2020
- Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming RelaxationsS. LiSIAM Journal on Computing, 49(4), FOCS17-409–FOCS17-440, 2020正式发表版本arXiv
- Constant Approximation Algorithm for Non-Uniform Capacitated Multi-Item Lot-Sizing via Strong Covering InequalitiesS. LiMathematics of Operations Research, 45(3), 947–965, 2020arXiv
2016
- A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2Julia Chuzhoy and S. LiJournal of the ACM, 63(5), 45:1–45:51, 2016
- On the Computational Complexity of Minimum-Concave-Cost Flow in a Two-Dimensional GridShabbir Ahmed, Qie He, S. Li and George NemhauserSIAM Journal on Optimization, 26(4), 2059–2079, 2016正式发表版本
- Approximating k-Median via Pseudo-ApproximationS. Li and Ola SvenssonSIAM Journal on Computing, 45(2), 530–547, 2016正式发表版本
- A Constant Factor Approximation Algorithm for Fault-Tolerant k-MedianMohammadtaghi Hajiaghayi, Wei Hu, Jian Li, S. Li and Barna SahaACM Transactions on Algorithms, 12(3), 36:1–36:19, 2016
