default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShaofeng H.-C. Jiang
Person information
- affiliation: Peking University, China
- affiliation (former): Aalto University, Finland
- affiliation (former): The Weizmann Institute of Science, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[c37]T.-H. Hubert Chan, Shaofeng H.-C. Jiang, Tianyi Wu, Mengshi Zhao:
Online Clustering with Nearly Optimal Consistency. ICLR 2025- [c36]Vincent Cohen-Addad, Shaofeng H.-C. Jiang, Qiaoyuan Yang, Yubo Zhang, Samson Zhou:
Fair Clustering in the Sliding Window Model. ICLR 2025 - [c35]Amir Carmel, Chengzhi Guo, Shaofeng H.-C. Jiang, Robert Krauthgamer:
Coresets for 1-Center in 𝓁₁ Metrics. ITCS 2025: 28:1-28:20 - [c34]Lingxiao Huang, Shaofeng H.-C. Jiang, Robert Krauthgamer, Di Yue:
Near-Optimal Dimension Reduction for Facility Location. STOC 2025: 665-676 - [i31]Arnold Filtser, Shaofeng H.-C. Jiang, Yi Li, Anurag Murty Naredla, Ioannis Psarros, Qiaoyuan Yang, Qin Zhang:
Faster Approximation Algorithms for k-Center via Data Reduction. CoRR abs/2502.05888 (2025) - [i30]Shaofeng H.-C. Jiang, Jianing Lou:
Coresets for Robust Clustering via Black-box Reductions to Vanilla Case. CoRR abs/2502.07669 (2025) - [i29]Vincent Cohen-Addad, Shaofeng H.-C. Jiang, Qiaoyuan Yang, Yubo Zhang, Samson Zhou:
Fair Clustering in the Sliding Window Model. CoRR abs/2503.05173 (2025) - [i28]Shaofeng H.-C. Jiang, Yaonan Jin, Jianing Lou, Pinyan Lu:
Local Search for Clustering in Almost-linear Time. CoRR abs/2504.03513 (2025) - [i27]Artur Czumaj, Guichen Gao, Mohsen Ghaffari, Shaofeng H.-C. Jiang:
Fully Scalable MPC Algorithms for Euclidean k-Center. CoRR abs/2504.16382 (2025) - 2024
- [j12]Shaofeng H.-C. Jiang
, Robert Krauthgamer, Jianing Lou, Yubo Zhang:
Coresets for kernel clustering. Mach. Learn. 113(8): 5891-5906 (2024) - [j11]Artur Czumaj, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Veselý:
Streaming Algorithms for Geometric Steiner Forest. ACM Trans. Algorithms 20(4): 28:1-28:38 (2024) - [j10]Guopeng Li, Haisheng Tan, Liuyan Liu, Hao Zhou, Shaofeng H.-C. Jiang, Zhenhua Han, Xiang-Yang Li, Guoliang Chen:
DAG Scheduling in Mobile Edge Computing. ACM Trans. Sens. Networks 20(1): 12:1-12:25 (2024) - [c33]Shaofeng H.-C. Jiang, Robert Krauthgamer, Shay Sapir:
Moderate Dimension Reduction for k-Center Clustering. SoCG 2024: 64:1-64:16 - [c32]Artur Czumaj, Guichen Gao, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Veselý:
Fully-Scalable MPC Algorithms for Clustering in High Dimension. ICALP 2024: 50:1-50:20 - [c31]Shaofeng H.-C. Jiang, Wenqian Wang, Yubo Zhang, Yuhao Zhang:
Algorithms for the Generalized Poset Sorting Problem. ICALP 2024: 92:1-92:15 - [c30]Sayan Bhattacharya, Gramoz Goranci, Shaofeng H.-C. Jiang, Yi Qian, Yubo Zhang:
Dynamic Facility Location in High Dimensional Euclidean Spaces. ICML 2024 - [c29]T.-H. Hubert Chan, Gramoz Goranci, Shaofeng H.-C. Jiang, Bo Wang, Quan Xue:
Fully Dynamic Algorithms for Euclidean Steiner Tree. WALCOM 2024: 62-75 - [i26]Lingxiao Huang, Shaofeng H.-C. Jiang, Robert Krauthgamer, Di Yue:
Near-Optimal Dimension Reduction for Facility Location. CoRR abs/2411.05432 (2024) - 2023
- [j9]Chi Zhang, Haisheng Tan, Haoqiang Huang, Zhenhua Han, Shaofeng H.-C. Jiang, Guopeng Li, Xiangyang Li:
Online Approximation Scheme for Scheduling Heterogeneous Utility Jobs in Edge Computing. IEEE/ACM Trans. Netw. 31(1): 352-365 (2023) - [c28]Kuan Cheng, Shaofeng H.-C. Jiang, Luojian Wei, Zhide Wei:
On The Relative Error of Random Fourier Features for Preserving Kernel Distance. ICLR 2023 - [c27]Lingxiao Huang, Shaofeng H.-C. Jiang, Jianing Lou, Xuan Wu:
Near-optimal Coresets for Robust Clustering. ICLR 2023 - [c26]Lingxiao Huang, Shaofeng H.-C. Jiang, Jianing Lou:
The Power of Uniform Sampling for k-Median. ICML 2023: 13933-13956 - [c25]Yecheng Xue, Xiaoyu Chen, Tongyang Li, Shaofeng H.-C. Jiang:
Near-Optimal Quantum Coreset Construction Algorithms for Clustering. ICML 2023: 38881-38912 - [c24]Xiaoyu Chen, Shaofeng H.-C. Jiang, Robert Krauthgamer:
Streaming Euclidean Max-Cut: Dimension vs Data Reduction. STOC 2023: 170-182 - [i25]Lingxiao Huang, Shaofeng H.-C. Jiang, Jian Li, Xuan Wu:
Coresets for Clustering with General Assignment Constraints. CoRR abs/2301.08460 (2023) - [i24]Lingxiao Huang, Shaofeng H.-C. Jiang, Jianing Lou:
The Power of Uniform Sampling for k-Median. CoRR abs/2302.11339 (2023) - [i23]Shaofeng H.-C. Jiang, Wenqian Wang, Yubo Zhang, Yuhao Zhang:
Algorithms for the Generalized Poset Sorting Problem. CoRR abs/2304.01623 (2023) - [i22]Yecheng Xue, Xiaoyu Chen, Tongyang Li, Shaofeng H.-C. Jiang:
Near-Optimal Quantum Coreset Construction Algorithms for Clustering. CoRR abs/2306.02826 (2023) - [i21]Artur Czumaj, Guichen Gao, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Veselý:
Fully Scalable MPC Algorithms for Clustering in High Dimension. CoRR abs/2307.07848 (2023) - [i20]T.-H. Hubert Chan, Gramoz Goranci, Shaofeng H.-C. Jiang, Bo Wang, Quan Xue:
Fully Dynamic Algorithms for Euclidean Steiner Tree. CoRR abs/2311.18365 (2023) - [i19]Shaofeng H.-C. Jiang, Robert Krauthgamer, Shay Sapir:
Moderate Dimension Reduction for k-Center Clustering. CoRR abs/2312.01391 (2023) - 2022
- [c23]Artur Czumaj, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Veselý, Mingwei Yang:
Streaming Facility Location in High Dimension via Geometric Hashing. FOCS 2022: 450-461 - [c22]Vladimir Braverman, Vincent Cohen-Addad, Shaofeng H.-C. Jiang, Robert Krauthgamer, Chris Schwiegelshohn, Mads Bech Toftrup, Xuan Wu:
The Power of Uniform Sampling for Coresets. FOCS 2022: 462-473 - [c21]Artur Czumaj, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Veselý:
Streaming Algorithms for Geometric Steiner Forest. ICALP 2022: 47:1-47:20 - [c20]Shaofeng H.-C. Jiang, Erzhi Liu, You Lyu, Zhihao Gavin Tang, Yubo Zhang:
Online Facility Location with Predictions. ICLR 2022 - [c19]Chi Zhang, Haisheng Tan, Guopeng Li, Zhenhua Han, Shaofeng H.-C. Jiang, Xiangyang Li:
Online File Caching in Latency-Sensitive Systems with Delayed Hits and Bypassing. INFOCOM 2022: 1059-1068 - [i18]Artur Czumaj, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Veselý, Mingwei Yang:
Streaming Facility Location in High Dimension via New Geometric Hashing. CoRR abs/2204.02095 (2022) - [i17]Vladimir Braverman, Vincent Cohen-Addad, Shaofeng H.-C. Jiang, Robert Krauthgamer, Chris Schwiegelshohn, Mads Bech Toftrup, Xuan Wu:
The Power of Uniform Sampling for Coresets. CoRR abs/2209.01901 (2022) - [i16]Kuan Cheng, Shaofeng H.-C. Jiang, Luojian Wei, Zhide Wei:
On The Relative Error of Random Fourier Features for Preserving Kernel Distance. CoRR abs/2210.00244 (2022) - [i15]Lingxiao Huang, Shaofeng H.-C. Jiang, Jianing Lou, Xuan Wu:
Near-optimal Coresets for Robust Clustering. CoRR abs/2210.10394 (2022) - [i14]Xiaoyu Chen, Shaofeng H.-C. Jiang, Robert Krauthgamer:
Streaming Euclidean Max-Cut: Dimension vs Data Reduction. CoRR abs/2211.05293 (2022) - 2021
- [j8]Haisheng Tan, Shaofeng H.-C. Jiang, Zhenhua Han, Mingxia Li:
Asymptotically Optimal Online Caching on Multiple Caches With Relaying and Bypassing. IEEE/ACM Trans. Netw. 29(4): 1841-1852 (2021) - [j7]Zhenhua Han, Haisheng Tan, Shaofeng H.-C. Jiang, Wanli Cao, Xiaoming Fu, Lan Zhang, Francis C. M. Lau:
SPIN: BSP Job Scheduling With Placement-Sensitive Execution. IEEE/ACM Trans. Netw. 29(5): 2267-2280 (2021) - [c18]Vladimir Braverman, Shaofeng H.-C. Jiang, Robert Krauthgamer, Xuan Wu:
Coresets for Clustering with Missing Values. NeurIPS 2021: 17360-17372 - [c17]Vladimir Braverman, Shaofeng H.-C. Jiang, Robert Krauthgamer, Xuan Wu:
Coresets for Clustering in Excluded-minor Graphs and Beyond. SODA 2021: 2679-2696 - [i13]Vladimir Braverman, Shaofeng H.-C. Jiang, Robert Krauthgamer, Xuan Wu:
Coresets for Clustering with Missing Values. CoRR abs/2106.16112 (2021) - [i12]Shaofeng H.-C. Jiang, Robert Krauthgamer, Jianing Lou, Yubo Zhang:
Coresets for Kernel Clustering. CoRR abs/2110.02898 (2021) - [i11]Shaofeng H.-C. Jiang, Erzhi Liu, You Lyu, Zhihao Gavin Tang, Yubo Zhang:
Online Facility Location with Predictions. CoRR abs/2110.08840 (2021) - 2020
- [j6]T.-H. Hubert Chan, Haotian Jiang, Shaofeng H.-C. Jiang:
A Unified PTAS for Prize Collecting TSP and Steiner Tree Problem in Doubling Metrics. ACM Trans. Algorithms 16(2): 24:1-24:23 (2020) - [c16]Daniel N. Baker, Vladimir Braverman, Lingxiao Huang, Shaofeng H.-C. Jiang, Robert Krauthgamer, Xuan Wu:
Coresets for Clustering in Graphs of Bounded Treewidth. ICML 2020: 569-579 - [c15]Zhenhua Han, Haisheng Tan, Shaofeng H.-C. Jiang, Xiaoming Fu, Wanli Cao, Francis C. M. Lau:
Scheduling Placement-Sensitive BSP Jobs with Inaccurate Execution Time Estimation. INFOCOM 2020: 1053-1062 - [c14]Chi Zhang, Haisheng Tan, Haoqiang Huang, Zhenhua Han, Shaofeng H.-C. Jiang, Nikolaos M. Freris, Xiang-Yang Li:
Online dispatching and scheduling of jobs with heterogeneous utilities in edge computing. MobiHoc 2020: 101-110 - [i10]Vladimir Braverman, Shaofeng H.-C. Jiang, Robert Krauthgamer, Xuan Wu:
Coresets for Clustering in Excluded-minor Graphs and Beyond. CoRR abs/2004.07718 (2020) - [i9]Artur Czumaj, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Veselý:
Streaming Algorithms for Geometric Steiner Forest. CoRR abs/2011.04324 (2020)
2010 – 2019
- 2019
- [j5]Haisheng Tan, Shaofeng H.-C. Jiang, Yupeng Li, Xiang-Yang Li, Chenzi Zhang, Zhenhua Han, Francis Chi-Moon Lau:
Joint Online Coflow Routing and Scheduling in Data Center Networks. IEEE/ACM Trans. Netw. 27(5): 1771-1786 (2019) - [j4]Zhenhua Han, Haisheng Tan, Xiang-Yang Li, Shaofeng H.-C. Jiang, Yupeng Li, Francis C. M. Lau:
OnDisc: Online Latency-Sensitive Job Dispatching and Scheduling in Heterogeneous Edge-Clouds. IEEE/ACM Trans. Netw. 27(6): 2472-2485 (2019) - [c13]Vladimir Braverman, Shaofeng H.-C. Jiang, Robert Krauthgamer, Xuan Wu:
Coresets for Ordered Weighted Clustering. ICML 2019: 744-753 - [c12]Haisheng Tan, Shaofeng H.-C. Jiang, Zhenhua Han, Liuyan Liu, Kai Han, Qinglin Zhao:
Camul: Online Caching on Multiple Caches with Relaying and Bypassing. INFOCOM 2019: 244-252 - [c11]Liuyan Liu, Haisheng Tan, Shaofeng H.-C. Jiang, Zhenhua Han, Xiang-Yang Li, Hong Huang:
Dependent task placement and scheduling with function configuration in edge computing. IWQoS 2019: 20:1-20:10 - [c10]Lingxiao Huang, Shaofeng H.-C. Jiang, Nisheeth K. Vishnoi:
Coresets for Clustering with Fairness Constraints. NeurIPS 2019: 7587-7598 - [i8]Vladimir Braverman, Shaofeng H.-C. Jiang, Robert Krauthgamer, Xuan Wu:
Coresets for Ordered Weighted Clustering. CoRR abs/1903.04351 (2019) - [i7]Lingxiao Huang, Shaofeng H.-C. Jiang, Nisheeth K. Vishnoi:
Coresets for Clustering with Fairness Constraints. CoRR abs/1906.08484 (2019) - [i6]Vladimir Braverman, Lingxiao Huang, Shaofeng H.-C. Jiang, Robert Krauthgamer, Xuan Wu:
Coresets for Clustering in Graphs of Bounded Treewidth. CoRR abs/1907.04733 (2019) - 2018
- [j3]T.-H. Hubert Chan, Shuguang Hu, Shaofeng H.-C. Jiang:
A PTAS for the Steiner Forest Problem in Doubling Metrics. SIAM J. Comput. 47(4): 1705-1734 (2018) - [j2]T.-H. Hubert Chan, Shaofeng H.-C. Jiang:
Reducing Curse of Dimensionality: Improved PTAS for TSP (with Neighborhoods) in Doubling Metrics. ACM Trans. Algorithms 14(1): 9:1-9:18 (2018) - [j1]T.-H. Hubert Chan, Zhiyi Huang, Shaofeng H.-C. Jiang, Ning Kang, Zhihao Gavin Tang:
Online Submodular Maximization with Free Disposal. ACM Trans. Algorithms 14(4): 56:1-56:29 (2018) - [c9]T.-H. Hubert Chan, Haotian Jiang, Shaofeng H.-C. Jiang:
A Unified PTAS for Prize Collecting TSP and Steiner Tree Problem in Doubling Metrics. ESA 2018: 15:1-15:13 - [c8]Lingxiao Huang, Shaofeng H.-C. Jiang, Jian Li, Xuan Wu:
Epsilon-Coresets for Clustering (with Outliers) in Doubling Metrics. FOCS 2018: 814-825 - [i5]Lingxiao Huang, Shaofeng H.-C. Jiang, Jian Li, Xuan Wu:
ε-Coresets for Clustering (with Outliers) in Doubling Metrics. CoRR abs/1804.02530 (2018) - 2017
- [c7]T.-H. Hubert Chan, Shaofeng H.-C. Jiang, Zhihao Gavin Tang, Xiaowei Wu:
Online Submodular Maximization Problem with Vector Packing Constraint. ESA 2017: 24:1-24:14 - [c6]T.-H. Hubert Chan, Zhiyi Huang, Shaofeng H.-C. Jiang, Ning Kang, Zhihao Gavin Tang:
Online Submodular Maximization with Free Disposal: Randomization Beats ¼ for Partition Matroids. SODA 2017: 1204-1223 - [i4]T.-H. Hubert Chan, Shaofeng H.-C. Jiang, Zhihao Gavin Tang, Xiaowei Wu:
Online Submodular Maximization Problem with Vector Packing Constraint. CoRR abs/1706.06922 (2017) - [i3]T.-H. Hubert Chan, Haotian Jiang, Shaofeng H.-C. Jiang:
A Unified PTAS for Prize Collecting TSP and Steiner Tree Problem in Doubling Metrics. CoRR abs/1710.07774 (2017) - 2016
- [c5]T.-H. Hubert Chan, Shuguang Hu, Shaofeng H.-C. Jiang:
A PTAS for the Steiner Forest Problem in Doubling Metrics. FOCS 2016: 810-819 - [c4]Yupeng Li, Shaofeng H.-C. Jiang, Haisheng Tan, Chenzi Zhang, Guihai Chen, Jipeng Zhou, Francis C. M. Lau:
Efficient online coflow routing and scheduling. MobiHoc 2016: 161-170 - [c3]T.-H. Hubert Chan, Shaofeng H.-C. Jiang:
Reducing Curse of Dimensionality: Improved PTAS for TSP (with Neighborhoods) in Doubling Metrics. SODA 2016: 754-765 - [i2]T.-H. Hubert Chan, Shuguang Hu, Shaofeng H.-C. Jiang:
A PTAS for the Steiner Forest Problem in Doubling Metrics. CoRR abs/1608.06325 (2016) - [i1]T.-H. Hubert Chan, Zhiyi Huang, Shaofeng H.-C. Jiang, Ning Kang, Zhihao Gavin Tang:
Online Submodular Maximization with Free Disposal: Randomization Beats 0.25 for Partition Matroids. CoRR abs/1610.07770 (2016) - 2015
- [c2]T.-H. Hubert Chan, Fei Chen, Shaofeng H.-C. Jiang:
Revealing Optimal Thresholds for Generalized Secretary Problem via Continuous LP: Impacts on Online K-Item Auction and Bipartite K-Matching with Random Arrival Order. SODA 2015: 1169-1188 - 2014
- [c1]Shenghui Cheng, Pradipta De, Shaofeng H.-C. Jiang, Klaus Mueller:
TorusVisND: unraveling high-dimensional torus networks for network traffic visualizations. VPA@SC 2014: 9-16
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-06-17 22:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
