65 citations · 105 across the 7 of their papers we have counts for
7 papers
Online Deterministic Minimum Cost Bipartite Matching with Delays on a Line
Tung-Wei Kuo
We study the online minimum cost bipartite perfect matching with delays problem. In this problem, servers and requests arrive over time, and an online algorithm can delay t…
Minimizing Norm of Flow Time by Starvation Mitigation
Tung-Wei Kuo
The assessment of a job's Quality of Service (QoS) often revolves around its flow time, also referred to as response time. This study delves into two fundamental objectives for sch…
No Need for Recovery: A Simple Two-Step Byzantine Consensus
Tung-Wei Kuo, Kung Chen
In this paper, we give a deterministic two-step Byzantine consensus protocol that achieves safety and liveness. A two-step Byzantine consensus protocol only needs two communication…
Minimum Age TDMA Scheduling
Tung-Wei Kuo
We consider a transmission scheduling problem in which multiple systems receive update information through a shared Time Division Multiple Access (TDMA) channel. To provide timely…
On the Approximability and Hardness of the Minimum Connected Dominating Set with Routing Cost Constraint
Tung-Wei Kuo
In the problem of minimum connected dominating set with routing cost constraint, we are given a graph , and the goal is to find the smallest connected dominating set o…
Leader-Contention-Based User Matching for 802.11 Multiuser MIMO Networks
Tung-Wei Kuo, Kuang-Che Lee, Kate Ching-Ju Lin +1
In multiuser MIMO (MU-MIMO) LANs, the achievable throughput of a client depends on who are transmitting concurrently with it. Existing MU-MIMO MAC protocols however enable clients…
On the Construction of Data Aggregation Tree with Minimum Energy Cost in Wireless Sensor Networks: NP-Completeness and Approximation Algorithms
Tung-Wei Kuo, Kate Ching-Ju Lin, Ming-Jer Tsai
In many applications, it is a basic operation for the sink to periodically collect reports from all sensors. Since the data gathering process usually proceeds for many rounds, it i…