1 citations · 1 across the 4 of their papers we have counts for
7 papers
Learning-Augmented Online Packet Scheduling with Deadlines
Ya-Chun Liang, Clifford Stein, Hao-Ting Wei
The modern network aims to prioritize critical traffic over non-critical traffic and effectively manage traffic flow. This necessitates proper buffer management to prevent the loss…
Online TSP with Predictions
Hsiao-Yu Hu, Hao-Ting Wei, Meng-Hsi Li +2
We initiate the study of online routing problems with predictions, inspired by recent exciting results in the area of learning-augmented algorithms. A learning-augmented online alg…
Scheduling with Speed Predictions
Eric Balkanski, Tingting Ou, Clifford Stein +1
Algorithms with predictions is a recent framework that has been used to overcome pessimistic worst-case bounds in incomplete information settings. In the context of scheduling, ver…
Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs
Chun-Hsiang Chan, Bundit Laekhanukit, Hao-Ting Wei +1
In the k-Connected Directed Steiner Tree problem (k-DST), we are given a directed graph G=(V, E) with edge (or vertex) costs, a root vertex r, a set of q terminals T, and a connect…
Waiting is not easy but worth it: the online TSP on the line revisited
Pei-Chuan Chen, Erik D. Demaine, Chung-Shou Liao +1
We consider the online traveling salesman problem on the real line (OLTSPL) in which a salesman begins at the origin, traveling at no faster than unit speed along the real line, an…
Link Delay Estimation Using Sparse Recovery for Dynamic Network Tomography
Hao-Ting Wei, Sung-Hsien Hsieh, Wen-Liang Hwang +2
When the scale of communication networks has been growing rapidly in the past decades, it becomes a critical challenge to extract fast and accurate estimation of key state paramete…
An -Approximation Algorithm for Dynamic Weighted Vertex Cover with Soft Capacity
Hao-Ting Wei, Wing-Kai Hon, Paul Horn +2
This study considers the (soft) capacitated vertex cover problem in a dynamic setting. This problem generalizes the dynamic model of the vertex cover problem, which has been intens…