Shaofeng H.-C. Jiang

Orcid: 0000-0001-7972-827X

Affiliations:
  • Peking University, China
  • Aalto University, Finland (former)
  • The Weizmann Institute of Science, Israel (former)


According to our database1, Shaofeng H.-C. Jiang authored at least 47 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Streaming Algorithms for Geometric Steiner Forest.
ACM Trans. Algorithms, October, 2024

Coresets for kernel clustering.
Mach. Learn., July, 2024

DAG Scheduling in Mobile Edge Computing.
ACM Trans. Sens. Networks, January, 2024

Fully Dynamic Algorithms for Euclidean Steiner Tree.
Proceedings of the WALCOM: Algorithms and Computation, 2024

Dynamic Facility Location in High Dimensional Euclidean Spaces.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Algorithms for the Generalized Poset Sorting Problem.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Fully-Scalable MPC Algorithms for Clustering in High Dimension.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Moderate Dimension Reduction for k-Center Clustering.
Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023
Online Approximation Scheme for Scheduling Heterogeneous Utility Jobs in Edge Computing.
IEEE/ACM Trans. Netw., February, 2023

Coresets for Clustering with General Assignment Constraints.
CoRR, 2023

Streaming Euclidean Max-Cut: Dimension vs Data Reduction.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Near-Optimal Quantum Coreset Construction Algorithms for Clustering.
Proceedings of the International Conference on Machine Learning, 2023

The Power of Uniform Sampling for k-Median.
Proceedings of the International Conference on Machine Learning, 2023

Near-optimal Coresets for Robust Clustering.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

On The Relative Error of Random Fourier Features for Preserving Kernel Distance.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

2022
Streaming Euclidean Max-Cut: Dimension vs Data Reduction.
CoRR, 2022

Streaming Facility Location in High Dimension via New Geometric Hashing.
CoRR, 2022

Online File Caching in Latency-Sensitive Systems with Delayed Hits and Bypassing.
Proceedings of the IEEE INFOCOM 2022, 2022

Online Facility Location with Predictions.
Proceedings of the Tenth International Conference on Learning Representations, 2022

Streaming Facility Location in High Dimension via Geometric Hashing.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

The Power of Uniform Sampling for Coresets.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021
Asymptotically Optimal Online Caching on Multiple Caches With Relaying and Bypassing.
IEEE/ACM Trans. Netw., 2021

SPIN: BSP Job Scheduling With Placement-Sensitive Execution.
IEEE/ACM Trans. Netw., 2021

Coresets for Clustering in Excluded-minor Graphs and Beyond.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Coresets for Clustering with Missing Values.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020
A Unified PTAS for Prize Collecting TSP and Steiner Tree Problem in Doubling Metrics.
ACM Trans. Algorithms, 2020

Online dispatching and scheduling of jobs with heterogeneous utilities in edge computing.
Proceedings of the Mobihoc '20: The Twenty-first ACM International Symposium on Theory, 2020

Scheduling Placement-Sensitive BSP Jobs with Inaccurate Execution Time Estimation.
Proceedings of the 39th IEEE Conference on Computer Communications, 2020

Coresets for Clustering in Graphs of Bounded Treewidth.
Proceedings of the 37th International Conference on Machine Learning, 2020

2019
Joint Online Coflow Routing and Scheduling in Data Center Networks.
IEEE/ACM Trans. Netw., 2019

OnDisc: Online Latency-Sensitive Job Dispatching and Scheduling in Heterogeneous Edge-Clouds.
IEEE/ACM Trans. Netw., 2019

Coresets for Clustering in Graphs of Bounded Treewidth.
CoRR, 2019

Coresets for Clustering with Fairness Constraints.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Dependent task placement and scheduling with function configuration in edge computing.
Proceedings of the International Symposium on Quality of Service, 2019

Camul: Online Caching on Multiple Caches with Relaying and Bypassing.
Proceedings of the 2019 IEEE Conference on Computer Communications, 2019

Coresets for Ordered Weighted Clustering.
Proceedings of the 36th International Conference on Machine Learning, 2019

2018
Reducing Curse of Dimensionality: Improved PTAS for TSP (with Neighborhoods) in Doubling Metrics.
ACM Trans. Algorithms, 2018

Online Submodular Maximization with Free Disposal.
ACM Trans. Algorithms, 2018

A PTAS for the Steiner Forest Problem in Doubling Metrics.
SIAM J. Comput., 2018

ε-Coresets for Clustering (with Outliers) in Doubling Metrics.
CoRR, 2018

Epsilon-Coresets for Clustering (with Outliers) in Doubling Metrics.
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2017
Online Submodular Maximization with Free Disposal: Randomization Beats ¼ for Partition Matroids.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Online Submodular Maximization Problem with Vector Packing Constraint.
Proceedings of the 25th Annual European Symposium on Algorithms, 2017

2016
Online Submodular Maximization with Free Disposal: Randomization Beats 0.25 for Partition Matroids.
CoRR, 2016

Efficient online coflow routing and scheduling.
Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing, 2016

2015
Revealing Optimal Thresholds for Generalized Secretary Problem via Continuous LP: Impacts on Online <i>K</i>-Item Auction and Bipartite <i>K</i>-Matching with Random Arrival Order.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014
TorusVis<sup>ND</sup>: unraveling high-dimensional torus networks for network traffic visualizations.
Proceedings of the First Workshop on Visual Performance Analysis, 2014


  Loading...