activity
20132026
most citedA polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint

6 citations · 11 across the 8 of their papers we have counts for

collaborators
Showing 2026Show all

2 papers · 1 filter

cs.DS2026

Breaking the Barrier for Maximum Weighted -Set Packing

Weitian Tong, Yao Xu

We give a deterministic polynomial-time -approximation for Maximum Weighted -Set Packing, breaking the locality-gap barrier of squared-weight local search. The…

cs.DS2026

Cross-Shift Analysis for Unrelated-Machine Weighted Completion Time A (1.3168+epsilon)-Approximation

Weitian Tong, Yao Xu

We study the problem of minimizing total weighted completion time on unrelated parallel machines with machine-independent job weights. The best previous approximation guarantee for…