An O(1)-Approximation Algorithm for Dynamic Weighted Vertex Cover with Soft Capacity. - Hao-Ting Wei; Wing-Kai Hon; Paul Horn; Chung-Shou Liao; Kunihiko Sadakane (APPROX-RANDOM, 2018)

Link Delay Estimation Using Sparse Recovery for Dynamic Network Tomography. - Hao-Ting Wei; Sung-Hsien Hsieh; Wen-Liang Hwang; Chung-Shou Liao; Chun-Shien Lu (CoRR, 2018)

Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs. - Chun-Hsiang Chan; Bundit Laekhanukit; Hao-Ting Wei; Yuhao Zhang 001 (APPROX-RANDOM, 2020)

Dynamic Network Tomography with Sparse Recovery-based Link Delay Estimation. - Hao-Ting Wei; Chung-Shou Liao; Sung-Hsien Hsieh; Chun-Shien Lu (WF-IoT, 2022)

Approximating Dynamic Weighted Vertex Cover with Soft Capacities. - Hao-Ting Wei; Wing-Kai Hon; Paul Horn; Chung-Shou Liao; Kunihiko Sadakane (Algorithmica, 2022)

Online TSP with Predictions. - Hsiao-Yu Hu; Hao-Ting Wei; Meng-Hsi Li; Kai-Min Chung; Chung-Shou Liao (CoRR, 2022)

Energy-Efficient Scheduling with Predictions. - Eric Balkanski; Noémie Périvier; Clifford Stein 001; Hao-Ting Wei (NeurIPS, 2023)

Learning-Augmented Online Packet Scheduling with Deadlines. - Clifford Stein 001; Hao-Ting Wei (CoRR, 2023)

Scheduling with Speed Predictions. - Eric Balkanski; Tingting Ou; Clifford Stein 001; Hao-Ting Wei (Theory Comput. Syst., 2025)