+86 (0)10 6275-0349
shaofeng.jiang
Room 206-1, Courtyard No.5, Jingyuan
Theoretical Computer Science, Algorithms in Massive Datasets, Approximation Algorithms, Online Algorithms https://shaofengjiang.cn/Bio-Sketch
Dr. Shaofeng Jiang joined Peking University in June 2021 and is currently an assistant professor at Center on Frontiers of Computing Studies, Peking University. He obtained his Ph.D. from the University of Hong Kong in 2017. He was a postdoctoral researcher in the Weizmann Institute of Science, and he worked as an assistant professor at Aalto University before joining Peking University. He was awarded a nomination prize of MSRA PhD fellowship, and a prize for outstanding postdoctoral research output in the Weizmann Institute of Science. His research interest is theoretical computer science, with a focus on algorithms for massive datasets and their applications in machine learning. His research has been published in various top venues including FOCS, SICOMP, SODA, ICML and NeurIPS. Currently, his focus is on the research and teaching in theoretical computer science and foundations of data science. He aims to produce high quality research, educate next generations of research and engineering talents in the area, and to improve the international visibility of the research center by maintaining an extensive international collaboration network.
Publications
Journal Papers
■ A Unified PTAS for Prize Collecting TSP and Steiner Tree Problem in Doubling Metrics. T-H. Hubert Chan, Haotian Jiang, Shaofeng H.-C. Jiang. TALG 2020.
■ OnDisc: Online Latency-Sensitive Job Dispatching and Scheduling in Heterogeneous Edge-Clouds. Zhenhua Han, Haisheng Tan, Xiang-Yang Li, Shaofeng H.-C. Jiang, Yupeng Li, Francis C.M. Lau. ToN 2019.
■ Joint Online Coflow Routing and Scheduling in Data Center Networks. Haisheng Tan, Shaofeng H.-C. Jiang, Yupeng Li, Xiang-Yang Li, Chenzi Zhang, Zhenhua Han, Francis C.M. Lau. ToN 2019.
■ A PTAS for the Steiner Forest Problem in Doubling Metrics. T-H. Hubert Chan, Shuguang Hu, Shaofeng H.-C. Jiang. SICOMP 2018.
■ Online Submodular Maximization with Free Disposal. T.-H. Hubert Chan, Zhiyi Huang, Shaofeng H.-C. Jiang, Ning Kang, Zhihao Gavin Tang. TALG 2018.
■ Reducing Curse of Dimensionality: Improved PTAS for TSP (with Neighborhoods) in Doubling Metrics. T-H. Hubert Chan, Shaofeng H.-C. Jiang. TALG 2018.
Conference Papers
■ Coresets for Clustering in Excluded-minor Graphs and Beyond. Vladimir Braverman, Shaofeng H.-C. Jiang, Robert Krauthgamer, Xuan Wu. SODA 2021.
■ Coresets for Clustering in Graphs of Bounded Treewidth. Daniel Baker, Vladimir Braverman, Lingxiao Huang, Shaofeng H.-C. Jiang, Robert Krauthgamer, Xuan Wu. ICML 2020.
■ Scheduling Placement-Sensitive BSP Jobs with Inaccurate Execution Time Estimation. Zhenhua Han, Haisheng Tan, Shaofeng H.-C. Jiang, Xiaoming Fu, Wanli Cao, Francis C.M. Lau. INFOCOM 2020.
■ Online Dispatching and Scheduling of Jobs with Heterogeneous Utilities in Edge Computing. Chi Zhang, Haisheng Tan, Haoqiang Huang, Zhenhua Han, Shaofeng H.-C. Jiang, Nikolaos Freris, XiangYang Li. Mobihoc 2020.
■ Coresets for Clustering with Fairness Constraints. Lingxiao Huang, Shaofeng H.-C. Jiang, Nisheeth Vishnoi. NeurIPS 2019.
■ Coresets for Ordered Weighted Clustering. Vladimir Braverman, Shaofeng H.-C. Jiang, Robert Krauthgamer, Xuan Wu. ICML 2019.
■ Camul: Online Caching on Multiple Caches with Relaying and Bypassing. Haisheng Tan, Shaofeng H.-C. Jiang, Zhenhua Han, Liuyan Liu, Kai Han, Qinglin Zhao. INFOCOM 2019.
■ epsilon-Coresets for Clustering (with Outliers) in Doubling Metrics. Lingxiao Huang, Shaofeng H.-C. Jiang, Jian Li, Xuan Wu. FOCS 2018.
■ A Unified PTAS for Prize Collecting TSP and Steiner Tree Problem in Doubling Metrics. T-H. Hubert Chan, Haotian Jiang, Shaofeng H.-C. Jiang. ESA 2018.
■ Online Submodular Maximization Problem with Vector Packing Constraint. T-H. Hubert Chan, Shaofeng H.-C. Jiang, Zhihao Gavin Tang, Xiaowei Wu. ESA 2017.
■ Online Submodular Maximization with Free Disposal: Randomization Beats 1/4 for Partition Matroids. T-H. Hubert Chan, Zhiyi Huang, Shaofeng H.-C. Jiang, Ning Kang, Zhihao Gavin Tang. SODA 2017.
■ A PTAS for the Steiner Forest Problem in Doubling Metrics. T-H. Hubert Chan, Shuguang Hu, Shaofeng H.-C. Jiang. FOCS 2016.
■ Efficient Online Coflow Routing and Scheduling. Yupeng Li, Shaofeng H.-C. Jiang, Haisheng Tan, Chenzi Zhang, Guihai Chen, Jipeng Zhou, Francis C.M. Lau. Mobihoc 2016.
■ Reducing Curse of Dimensionality: Improved PTAS for TSP (with Neighborhoods) in Doubling Metrics. T-H. Hubert Chan, Shaofeng H.-C. Jiang. SODA 2016.
■ Revealing Optimal Thresholds for Generalized Secretary Problem via Continuous LP: Impacts on Online K-Item Auction and Bipartite K-Matching with Random Arrival Order. T-H. Hubert Chan, Fei Chen, Shaofeng H.-C. Jiang. SODA 2015.