Shi Li
Orcid: 0000-0001-9140-9415Affiliations:
- Nanjing University, China
- University at Buffalo, Department of Computer Science and Engineering, NY, USA (former)
- Toyota Technological Institute at Chicago, IL, USA (former)
- Princeton University, Department of Computer Science, NJ, USA (PhD 2014)
- Tsinghua University, Department of Computer Science and Technology, State Key Laboratory of Intelligent Technology and Systems, Beijing, China (2004 - 2008)
According to our database1,
Shi Li
authored at least 80 papers
between 2010 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on linkedin.com
-
on orcid.org
-
on dl.acm.org
On csauthors.net:
Bibliography
2025
ACM Trans. Algorithms, January, 2025
Approximating Unrelated Machine Weighted Completion Time Using Iterative Rounding and Computer Assisted Proofs.
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025
2024
Algorithmica, April, 2024
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024
Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, 2024
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024
Proceedings of the Approximation, 2024
2023
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023
Handling Correlated Rounding Error via Preclustering: A 1.73-approximation for Correlation Clustering.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023
2022
Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022
Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022
2021
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021
Proceedings of the 38th International Conference on Machine Learning, 2021
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021
2020
Theory Comput., 2020
SIAM J. Discret. Math., 2020
Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations.
SIAM J. Comput., 2020
Constant Approximation Algorithm for Nonuniform Capacitated Multi-Item Lot Sizing via Strong Covering Inequalities.
Math. Oper. Res., 2020
Robust high dimensional expectation maximization algorithm via trimmed hard thresholding.
Mach. Learn., 2020
Estimating stochastic linear combination of non-linear regressions efficiently and scalably.
Neurocomputing, 2020
The Power of Recourse: Better Algorithms for Facility Location in Online and Dynamic Models.
CoRR, 2020
Hierarchy-Based Algorithms for Minimizing Makespan under Precedence and Communication Constraints.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020
Proceedings of the Approximation, 2020
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020
2019
$O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm.
SIAM J. Comput., 2019
Tight Approximation for Variants of Directed Steiner Tree via State-Tree Decomposition and Linear Programming Rounding.
CoRR, 2019
<i>O</i>(log<sup>2</sup> <i>k</i> / log log <i>k</i>)-approximation algorithm for directed Steiner tree: a tight quasi-polynomial-time algorithm.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019
Lift and Project Algorithms for Precedence Constrained Scheduling to Minimize Completion Time.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019
Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2019
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019
Automating CSI Measurement with UAVs: from Problem Formulation to Energy-Optimal Solution.
Proceedings of the 2019 IEEE Conference on Computer Communications, 2019
2018
O(log<sup>2</sup>k/log log k)-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial-Time Algorithm.
CoRR, 2018
Constant approximation for k-median and k-means with outliers via iterative rounding.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018
Flow-time Optimization for Concurrent Open-Shop and Precedence Constrained Scheduling Models.
Proceedings of the Approximation, 2018
2017
ACM Trans. Algorithms, 2017
Constant Approximation Algorithm for Non-Uniform Capacitated Multi-Item Lot-Sizing via Strong Covering Inequalities.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017
Proceedings of the Integer Programming and Combinatorial Optimization, 2017
2016
ACM Trans. Algorithms, 2016
On the Computational Complexity of Minimum-Concave-Cost Flow in a Two-Dimensional Grid.
SIAM J. Optim., 2016
J. ACM, 2016
Electron. Colloquium Comput. Complex., 2016
CoRR, 2016
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016
Better Unrelated Machine Scheduling for Weighted Completion Time via Random Offsets from Non-uniform Distributions.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016
2015
Internet Math., 2015
A Dynamic Programming Framework for Non-Preemptive Scheduling Problems on Multiple Machines [Extended Abstract].
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015
2014
PhD thesis, 2014
Deriving Vegetation Phenological Time and Trajectory Information Over Africa Using SEVIRI Daily LAI.
IEEE Trans. Geosci. Remote. Sens., 2014
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014
2013
Inf. Comput., 2013
CoRR, 2013
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013
2012
CoRR, 2012
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012
2010
IEEE/ACM Trans. Netw., 2010
CoRR, 2010
Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010