您现在的位置: bwin必赢 » 师资队伍 » 教研系列 » 按名字 » J » 正文

师资队伍

J

姜少峰

职称:助理教授

研究所:前沿计算研究中心

研究领域:理论计算机科学,大数据上的算法,近似算法,在线算法

办公电话:+86 (0)10 6275-0349

电子邮件:shaofeng.jiangpku.edu.cn

个人主页:https://shaofengjiang.cn

简介

姜少峰博士,现任北京大学前沿计算研究中心助理教授,博士生导师,北京大学博雅青年学者,于2021年6月正式加入中心。他于2017年在香港大学取得博士学位,曾在以色列魏茨曼科学研究学院(Weizmann Institute of Science)进行为期三年的博士后研究,并曾在芬兰阿尔托大学(Aalto University)任助理教授。他博士在读期间获微软亚洲研究院PhD Fellowship提名奖,博士后研究获魏茨曼杰出博士后研究成果奖。他的研究方向为理论计算机科学,近期侧重于大数据算法及其在机器学习中的应用,并已经在包括FOCS,SICOMP,SODA,ICML,NeurIPS等的主流国际期刊和会议上发表论文多篇。姜少峰博士现致力于理论计算机科学、数据科学理论基础等方面的教学和科研,并与国际知名机构积极展开合作,积极推进相关方向的人才培养和科研产出,提升中心的国际影响力。

发表论著

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.